凸二次规划 [
tū èr cì guī huà]
[数] convex quadratic programming
- 介绍一种求解高维凸二次规划的可行方向法。
This paper introduces a feasible direction method for solving high-dimensional convex quadratic programming. - 第三章给出了求解凸二次规划的不可行内点算法,并分析了其收敛性;
While in chapter three, the infeasible interior point algorithm for convex quadratic programming is presented, and its convergence is analyzed too. - 五是研究了凸规划包括线性规划和凸二次规划的参数控制算法及其收敛性。
Fifthly, the parameter control methods for solving convex programming, especially linear programming and convex quadratic programming, are discussed and its convergenceIVis probed.