A Predictor-corrector algorithm with multiple corrections for convex quadratic programming
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Shinji Mizuno & Michael J. Todd & Yinyu Ye, 1993. "On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming," Mathematics of Operations Research, INFORMS, vol. 18(4), pages 964-981, November.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Da Tian, 2015. "An exterior point polynomial-time algorithm for convex quadratic programming," Computational Optimization and Applications, Springer, vol. 61(1), pages 51-78, May.
More about this item
KeywordsConvex quadratic programming; Primal-dual interior-point method; Predictor-corrector; Polynomial complexity;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:52:y:2012:i:2:p:373-391. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .