Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4664937 | Acta Mathematica Scientia | 2006 | 6 Pages |
Abstract
This article presents a polynomial predictor-corrector interior-point algorithm for convex quadratic programming based on a modified predictor-corrector interior-point algorithm. In this algorithm, there is only one corrector step after each predictor step, where Step 2 is a predictor step and Step 4 is a corrector step in the algorithm. In the algorithm, the predictor step decreases the dual gap as much as possible in a wider neighborhood of the central path and the corrector step draws iteration points back to a narrower neighborhood and make a reduction for the dual gap. It is shown that the algorithm has iteration complexity which is the best result for convex quadratic programming so far.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematics (General)