首页> 美国政府科技报告 >Generalized Conjugate Gradient Algorithm for Solving a Class of Quadratic Programming Problems
【24h】

Generalized Conjugate Gradient Algorithm for Solving a Class of Quadratic Programming Problems

机译:求解一类二次规划问题的广义共轭梯度算法

获取原文

摘要

Matrix splitting techniques and a conjugate gradient algorithm are applied to the problem of minimizing a convex quadratic form subject to upper and lower bounds on the variables. This method exploits sparsity structure in the matrix of the quadratic form. Choices of the splitting operator are discussed and convergence results are established. Results are presented of numerical experiments showing the effectiveness of the algorithm on free boundary problems for elliptic partial differential equations; comparisons with other algorithms are given. 8 figures, 2 tables. (ERA citation 03:056316)

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号