SOLVING CONVEX QUADRATIC PROGRAMMING BY POTENTIAL-REDUCTION INTERIOR-POINT ALGORITHM

摘要

The solution of quadratic programming problems is an important issue in the field of mathematical programming and industrial applications. In this paper, we solve convex quadratic programming by a potential- reduction interior - point algorithm. It is proved that the potential - reduction interior-point algorithm is glo- bally convergent. Some numerical experiments were made.