一类特殊规划的求解算法

A solve algorithm of positive definite quadratic programming

二次规划问题是一类重要的优化问题,是NP困难的.通过对已有算法的理解与分析,在假设原问题的Hessian矩阵正定的条件下,作者给出了求解二次规划问题的一种新算法,并讨论了算法的收敛性.

Quadratic programming algorithms have already been found to problem. A new algorithm for solving showed that the algorithm converged to is an important optimal problem and is a NP -hard problem. Some solve it. Here we considered positive definite quadratic programming positive definite quadraic programming problem was presented. We the optimal solution of the original problem.