0) Р Abstract РBased on the analysis of solving convex quadratic programming with the complementary rotating axis Рalgorithm of classical Lemke, find the localization of the Lemke algorithm. This paper revises the Рiterative process of the classical Lemke algorithm based on the Lemke algorithm solving the Linear РComplementary Problem, proposes a improved Lemke algorithm and demonstrates that the new Рalgorithm could effectively overcome the localization of solution by The experimental results, Рdecreasing iterative process of the convex quadratic programming, improving the algorithmic Рefficiency. РKeywords: nonlinear optimization；convex quadratic programming； Linear Complementary Problem；РLemke algorithm Р РРР - 10 -
全文预览
