【摘要】 线性互补问题的投影Jacobi松弛算法应用于求解不等式约束的二次规划问题,对称半正定的二次规划问题由K-T条件可以转化为P₀-矩阵的非对称线性互补问题（LCP）,通过求解带扰动项的P-矩阵的非对称线性互补问题得到二次规划的最优解。最后给出一些数值结果。更多还原

【Abstract】 Projected Jacobi relaxation algorithm for linear complementarity problem is applied to solve convex quadratic programming with inequality constraints. According to the Kuhn-Tucker condition, convex quadratic programming is changed to nonsymmetric linear complementarity problem with the P_o-matrix. The optimal solution of the convex quadratic programming is given by solving perturbed nonsymmetric linear complementarity problem. Finally, some numerical results are given.更多还原