The analyticity of interior-point-paths at strictly complementary solutions of linear programs

References

• Gonzaga , C. 1989 . “ An algorithms for solving linear programming problems in O(n 3 L) operations ” . In Progress in Mathematical Programming — Interior Point and Related Methods , Edited by: Megiddo . Berlin : Springer Verlag . Chap 1
   Google Scholar
• Grandshteyn , I.S. and Ryzhik , I.M. 1980 . “ Table of Integrals, Series, and Products ” . In corrected and enlarged edition , New York : Academic Press .
   Google Scholar
• Güler , O. 1994 . Limiting behavior of weighted central paths in linear programming . Math. Programming , 65 : 347 – 363 .
   Google Scholar
• Halická , M. 1997 . “ Analyticity properties of the central path at boundary point in linear programming ” . In Mathematics preprint , Bratislava : Comenius University . Slovakia
   Google Scholar
• Jansen , B. , Roos , C. , Terlaky , T. and Vial , J.Ph . 1993 . Interior Point Methodology for Linear Programming: Duality, Sensitivity and Computational Aspects , The Netherlands : Delft University of Technology . Report 93-28 Delft
   Google Scholar
• Karmarkar , N. 1984 . A new polynomial time algorithm for linear programming . Combinatorica , 4 : 373 – 395 .
   Web of Science ®Google Scholar
• Khachiyan , L.G. 1979 . A polynomial algorithm for linear programming . Soviet.Math. DokL , 20 : 191 – 194 .
   Google Scholar
• Kojima , M. , Megiddo , N. and Mizuno , S. 1991 . A primal-dual exterior point algorithm for linear programming , San Jose, CA : IBM Almaden Research Center . Research Report RJ 8500
   Google Scholar
• Kojima , M. , Megiddo , N. and Mizuno , S. 1992 . A primal-dual infeasible-intericr point algorithm for linear programming . Math. Prog , 61 : 263 – 280 .
   Google Scholar
• Lustig , I. , Marston , R. and Shanno , D. 1992 . On implementing Mehrotra's predictor-corrector interior-point method for linear programming . SIAM J. Optimization , 2 : 435 – 449 .
   Web of Science ®Google Scholar
• Mehrotra , S. 1992 . On the implemntation of a primal-dual interior point method . SIAM J. Optimization , 2 : 575 – 601 .
   Web of Science ®Google Scholar
• Shor , N. 1970 . Utilization of the operation of space dilatation in the minimizatiori of convex functions . Kibernetika , 1 : 6 – 12 .
   Google Scholar
• Sonnevend , G. 1985 . “ An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming ” . In Lecture Notes in Control and Informations Sciences , Vol. 84 , 866 – 876 . Berlin : Springer Verlag . Heidelberg-New York
   Google Scholar
• Stoer , J. 1994 . Infeasible interior point methods for solving linear programs , Vol. 434 , 415 – 434 . Kluwer : Dordrecht . In: NATO-ASI Series C: Math and Physical Sciences
   Google Scholar
• Stoer , J. 1994 . Analysis of infeasible interior-point path of linear programs , Würzburg, , Germany : University of Würzburg . Technical Report No. 215, Dept. of Appl. Math, and Statistics
   Google Scholar
• Stoer , J. and Wechs , M. 1996 . On the analyticity properties in infeasible-interior-point paths for monotone linear complementarity problems . Numer. Math , to appear
   Google Scholar
• Vaidya , P.M. 1990 . An algorithm for linear programming with requires O(((m+n+)n 2 + (m + n)1.5 n)L) arithmetic operations . Math Programming , 47 : 175 – 202 .
   Web of Science ®Google Scholar
• Wechs , M. 1995 . Die analytische Struktur zentraler Pfade und ihre Anwendung , Würzburg, , Germany : University of Würzburg . Diploma thesis, Dept. of Appl. Math, and Statistics
   Google Scholar
• Ye , Y. , Todd , M.J. and Mizuno , S. 1994 . An iteration homogeneous and self-dual linear programming algorithm . Math, of Operation Research , 19 : 53 – 67 .
   Web of Science ®Google Scholar
• Zhao , G. and Zhu , J. 1993 . Thè curvature integral and the complexity of linear complementarity problems , Singapur : National University of Singapur . Research Report No. 568 Department of Mathematics
   Google Scholar
• Yudin , D. and Nemirovskii , A. 1976 . Informational complexity and efficient methods for the solution of convex extremal problems . Matekon , 13 : 3 – 25 .
   Google Scholar