Science & Engineering |
|
|
|
|
SOLVING CONVEX QUADRATIC PROGRAMMING BY POTENTIAL-REDUCTION INTERIOR-POINT ALGORITHM |
LIANG Xi-ming, MA Long-hua, QIAN Ji-xin |
College of Information Science & Engineering, Central South University, Changsha 410083, China; Institute of Systems Engineering, National Lab of Industrial Control Technology, Zhejiang University,Hangzhou 310027, China |
|
|
Abstract 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 globally convergent. Some numerical experiments were made.
|
Received: 18 June 1999
|
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|