A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming |
| |
| Authors: | Yanjin Wang |
| |
| Affiliation: | 1. Institute of Applied Physics and Computational Mathematics , Beijing, P. R. China wang_jasonyj2002@yahoo.com wang_yanjin@iapcm.ac.cn |
| |
| Abstract: | This article proposes a class of infeasible interior point algorithms for convex quadratic programming, and analyzes its complexity. It is shown that this algorithm has the polynomial complexity. Its best complexity is O(nL). |
| |
| Keywords: | Convex quadratic programming Infeasible interior point algorithm Polynomial complexity |
|
