Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization

References

• Alizadeh F. , Haeberly J.-P. A. , Overton M. L. Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results. (1996) . Technical report, Computer Science Dept., New York University, New York Google Scholar
• Faraut J. , Korányi A. Analysis on Symmetric Cones (1994) (Oxford University Press, New York) Google Scholar
• Faybusovich L. Jordan algebras, symmetric cones and interior-point methods. Manuscript (1995) (Dept. of Mathematics, University of Notre Dame, Indiana) Google Scholar
• Güler O. Private communication (1994) Google Scholar
• Güler O. Barrier functions in interior point methods. Math. Oper. Res. (1996) 21 860 885 Link, Google Scholar
• Güler O. , Tunçel L. Characterization of the barrier parameter of homogeneous convex cones. Math. Programming . (To appear) Google Scholar
• Helmberg C. , Rendl F. , Vanderbei R. , Wolkowicz H. An interior-point method for semidefinite programming. SIAM J. Optim. (1996) 6 342 361 Crossref, Google Scholar
• Kojima M. , Megiddo N. , Noma T. , Yoshise A. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems (1991) (Springer-Verlag, New York) . Lecture Notes in Computer Science No. 538 Crossref, Google Scholar
• Kojima M. , Mizuno S. , Yoshise A. , Megiddo N. A primal-dual interior point algorithm for linear programming. Progress in Mathematical Programming, Interior Point and Related Methods (1988) (Springer-Verlag, New York) 29 47 Google Scholar
• Kojima M. , Mizuno S. , Yoshise A. An O(√nL) iteration potential reduction algorithm for linear complementarity problems. Math. Programming (1991) 50 331 342 Crossref, Google Scholar
• Kojima M. , Shindoh S. , Hara S. Interior-point methods for the monotone linear complementarity problem in symmetric matrices. SIAM J. Optim. (1997) 7 86 125 Crossref, Google Scholar
• Luo Z.-Q. , Sturm J. F. , Zhang S. Duality and self-duality for conic convex programming (1996) . Report 9620/A, Econometric Institute, Erasmus University, Rotterdam Google Scholar
• Mizuno S. , Todd M. J. , Ye Y. On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. (1993) 18 964 981 Link, Google Scholar
• Monteiro R. D. C. Primal-dual path following algorithms for semidefinite programming. SIAM J. Optim. (1997) 7 663 678 Crossref, Google Scholar
• Nesterov Yu. E. , Nemirovskii A. S. Interior-point Polynomial Algorithms in Convex Programming (1994) (SIAM Publications, Philadelphia, Pennsylvania) Crossref, Google Scholar
• Nesterov Yu. E. , Todd M. J. Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. . (To appear) Google Scholar
• Nesterov Yu. E. , Todd M. J. Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. (1997) 22 1 46 Link, Google Scholar
• Nesterov Yu. E. , Todd M. J. , Ye Y. Primal-dual methods and infeasibility detectors for nonlinear programming problems. (1996) . Technical report, School of OR and IE, Cornell University, Ithaca, New York Google Scholar
• Rockafellar R. T. Convex Analysis (1970) (Princeton University Press, Princeton, New Jersey) Crossref, Google Scholar
• Rothaus O. S. Domains of positivity. Abh. Math. Sem. Univ. Hamburg (1960) 24 189 235 Crossref, Google Scholar
• Sturm J. F. , Zhang S. Symmetric primal-dual path following algorithms for semidefinite programming (1995) . Report 9554/A, Econometric Institute, Erasmus University, Rotterdam Google Scholar
• Todd M. J. , Toh K. C. , Tütüncü R. H. On the Nesterov-Todd direction in semi-definite programming. SIAM J. Optim. . (To appear) Google Scholar
• Tseng P. Search directions and convergence analysis of some infeasible path-following methods for the monotone semi-definite LCP. Optim. Methods Softw. . (To appear) Google Scholar
• Vinberg È. B. The theory of homogeneous cones. Trans. Moscow Math. Soc. (1965) 12 340 403 Google Scholar
• Ye Y. , Todd M. J. , Mizuno S. An O(√nL) iteration homogeneous and self-dual linear programming. Math. Oper. Res. (1994) 19 53 67 Link, Google Scholar
• Zhang Y. On extending primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. . (To appear) Google Scholar