A Primal-dual affine scaling algorithm with necessary centering as a safeguard

References

• Adler , I. , Karmarkar , N. , Resende , M.G.C. and Veiga , G. 1989 . An implementation of Karmarkar's algorithm for linear programming . Mathematical Programming , 44 : 297 – 335 .
   Web of Science ®Google Scholar
• Bayer , D.A. and Lagarias , J.C. 1990 . The nonlinear geometry of linear programming, I, II, III . Transaction of the American Mathematical Society , 314 : 499 – 526 . 527-581, and 320, 193-225
   Google Scholar
• Jansen , B. , Roos , C. and Terlaky , T. 1993 . A polynomial primal-dual Dikin-type algorithm for linear programming , The Netherlands : TU Delft . Report 93-36,Faculty of Technical mathematics and Informatics
   Google Scholar
• Jarre , F.I. , Sonnevend , G. and Stoer , J. 1988 . An implementation of the method of analytic centers . Lect Notes in Control and Inf Sci , 111 : 297 – 307 .
   Google Scholar
• Kojima , M. , Megiddo , N. and Mizuno , S. 1993 . Theoretical convergence of large-step primal-dual interior point algorithms for linear programming . Mathematical Programming , 59 : 1 – 21 .
   Web of Science ®Google Scholar
• Megiddo , N. and Shub , M. 1989 . Boundary behavior of interior point algorithms in linear programming . Mathematics of Operations Research , 14 : 97 – 146 .
   Web of Science ®Google Scholar
• Mizuno , S. , Todd , M.J. and Ye , Y. Anticipated behavior of path-following algorithm for linear programming Technical Report No. 878, School of Operations Research and Industrial Engineering
   Google Scholar
• Mizuno S. Todd M. J. Ye Y. On adaptive-step primal-dual interior-point algorithm for linear programming Mathematics of Operations Research School of Operations Research and Industrial Engineering, Cornell University Ithaca, NY 1990 Technical Report No. 944 to apear in
   Google Scholar
• Monteiro , R.D.C. , Adler , I. and Resende , M.G.C. 1990 . A polynomial-time prime-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension . Mathematics of Operations Research , 15 : 191 – 214 .
   Web of Science ®Google Scholar
• Nesterov , Y. and Nemirovskii , A. Interior Point Polynomial Algorithms in Convex Programming
   Google Scholar
• Sonnevend , G. 1989 . “ An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming ” . In Lecture Notes in Control and Information Sciences , Vol. 84 , 866 – 876 . Springer-Verlag .
   Google Scholar
• Todd , M. 1989 . “ Recent developments and new directions in linear programming ” . In Mathematical Programming–Recent Developments and Applications , Edited by: Iri , M. 109 – 157 . Kluwer Academic Publishers .
   Google Scholar
• Witzgall , C. , Boggs , P.T. and Domich , P.D. 1991 . “ On the convergence behavior of trajectories for linear programming" ” . In Contemporary Mathematics , Edited by: Lagarias , J.C. and Todd , M.J. Vol. 114 , 161 – 187 . Providence, RI : Americal Mathematical Society .
   Google Scholar
• Zhao , G. and Stoer , J. 1993 . Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals . Appl. Math, and Optimization , 27 : 85 – 103 .
   Google Scholar