【摘要】 用线性的方法研究一个二次规划的算法问题。对于一般的二次规划的算法常导致极端Kuhn Tucker点被改变成一些有限点问题后 ,严格的凸二次规划总是就有限收敛了更多还原

【Abstract】 A quadratic programming algorithm was presented with Armijo’s line search. For general quadratic programming, the algorithm either converges to a Kuhn Tucker point of problem in finite steps, or generates infinite point sequence such that any finite cluster point is the Kuhn Tucker point of problem. For strictly convex quadratic programming, the algorithm has finite convergence.更多还原