Solving convex quadratic programming by potential-reduction interior-point algorithm |
| |
| Authors: | Liang Xi-ming Ma Long-hua Qian Ji-xin |
| |
| Institution: | (1) College of Information Science & Engineering, Central South University, 410083 Changsha, China;(2) Institute of Systems Engineering, National Lab of Industrial Control Technology, Zhejiang University, 310027 Hangzhou, 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. |
| |
| Keywords: | potential-reduction interior-point algorithm convex quadratic programming convergence numerical experiments |
| 本文献已被 SpringerLink 等数据库收录！ |
