Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 62, 2013 - Issue 2
126
Views
8
CrossRef citations to date
0
Altmetric
Articles

An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization

&
Pages 285-297 | Received 20 Oct 2009, Accepted 31 Jul 2011, Published online: 19 Sep 2011

References

  • Andersen , ED and Ye , Y . 1998 . A computational study of the homogeneous algorithm for large-scale convex optimization . Comput. Appl. Optim. , 10 : 243 – 269 .
  • Karmarkar , N . 1984 . New polynomial-time algorithm for linear programming . Combinatorica , 4 : 373 – 395 .
  • Kojima , M , Megiddo , N and Mizuno , S . 1993 . A primal-dual infeasible-interior-point algorithm for linear programming . Math. Program. , 61 : 263 – 280 .
  • Lustig , IJ . 1990/91 . Feasibility issues in a primal-dual interior point method for linear programming . Math. Program. , 49 : 145 – 162 .
  • Mansouri , H . June 2008 . “ Full-Newton step interior-point methods for conic optimization ” . In PhD thesis , June , NL–2628 CD Delft , , The Netherlands : Faculty of Mathematics and Computer Science, TU Delft .
  • Mansouri , H and Roos , C . 2007 . Simplified O(n) infeasible interior-point algorithm for linear optimization using full-Newton step . Optim. Methods Softw. , 22 : 519 – 530 .
  • Mizuno , S . 1994 . Polynomiality of infeasible interior point algorithms for linear programming . Math. Program. , 67 : 109 – 119 .
  • Potra , FA . 1996 . An infeasible-interior-point predictor-corrector algorithm for linear programming . SIAM J. Optim. , 6 : 19 – 32 .
  • Roos , C . 2006 . A full-Newton step O(n) infeasible interior-point algorithm for linear optimization . SIAM J. Optim. , 16 : 1110 – 1136 .
  • Roos , C , Terlaky , T and Vial , J-Ph . 1997 . Theory and Algorithms for Linear Optimization. An Interior-Point Approach , Chichester , , UK : Wiley & Sons . (2nd ed., Springer, 2005)
  • Tanabe , K . 1990 . “ Centered Newton method for linear programming: Interior and ‘exterior’ point method ” . In New Methods for Linear Programming , Edited by: Tone , K . Vol. 3 , 98 – 100 . Tokyo, Japan : The Institute of Statistical Mathematics . (in Janpanese)
  • Wu , F , Wu , S and Ye , Y . 1999 . On quadratic convergence of the -iteration homogeneous and self-dual linear programming algorithm . Ann. Oper. Res. , 87 : 393 – 406 .
  • Ye , Y . 1997 . Interior Point Algorithms, Theory and Analysis , Chichester , , UK : Wiley & Sons .
  • Ye , Y , Todd , MJ and Mizonu , S . 1994 . An O(nL)-iteration homogenous and self-dual linear programming algorithm . Math. Oper. Res. , 19 : 53 – 67 .
  • Zhang , Y . 1994 . On the convergence of a class of infeasible-interior-point methods for the horizontal linear complementarity problem . SIAM J. Optim. , 4 : 208 – 227 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.