| 球约束凸二次规划的一个算法 |
| |
| 引用本文： | 种国富,郭宗庆.球约束凸二次规划的一个算法[J].海军工程大学学报,2007,19(3):39-42. |
| |
| 作者姓名： | 种国富 郭宗庆 |
| |
| 作者单位： | 焦作师范高等专科学校,数学系,河南,焦作,454000 |
| |
| 摘 要： | 针对球约束凸二次规划问题,利用Lagrange对偶将其转化为无约束优化问题,然后运用单纯形法对其求解,获得原问题的最优解。最后,对文中给出的算法给出了论证。
|
| 关 键 词： | 球约束 凸二次规划 无约束优化问题 单纯形法 |
| 文章编号： | 1009-3486(2007)03-0039-04 |
| 修稿时间： | 2006年11月12 |
One method of solving the problem of sphere-constrained convex quadratic programming |
| |
| CHONG Guo-fu,GUO Zong-qing.One method of solving the problem of sphere-constrained convex quadratic programming[J].Journal of Naval University of Engineering,2007,19(3):39-42. |
| |
| Authors: | CHONG Guo-fu GUO Zong-qing |
| |
| Abstract: | In this paper the duality of Lagrange is used to convert the problem of sphere-constrained convex quadratic programming into the problem of unconstrained optimization.Then the simplex algorithm is applied for the solution of unconstrained optimization problem.Thus the best solution of the original problem is obtained. |
| |
| Keywords: | sphere-constrained convex quadratic programming unconstrained optimization problem simplex algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
