Primal-dual interior-point methods for self-scaled cones

SIAM Journal on Optimization

Volumn 8, Issue 2, 1998, Pages 324-364

  Nesterov, Yu E ^a   Todd, M J ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b School of Operations Research and Industrial Engineering   (United States)

Author keywords

Conical form; Convex programming; Interior point algorithms; Path following algorithms; Self concordant barrier; Self scaled barrier; Self scaled cone; Symmetric primal dual algorithms

Indexed keywords

EID: 0032222088     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623495290209     Document Type: Article

References (13)

1. I. EKELAND AND R. TEMAM, Convex Analysis and Variational Problems, North-Holland, Amsterdam, 1976.
2. O. GÜLER, Barrier functions in interior-point methods, Math. Oper. Res., 21 (1996), pp. 860-885.
3. N. K. KARMARKAR, A new polynomial-time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
4. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A polynomial-time algorithm for a class of linear complementarity problems, Math. Programming, 44 (1989), pp. 1-26.
5. S. MIZUNO, M. J. TODD, AND Y. YE, On adaptive step primal-dual interior-point algorithms for linear programming, Math. Oper. Res., 18 (1993), pp. 964-981.
6. S. MIZUNO, A. YOSHISE, AND T. KIKUCHI, Practical polynomial time algorithms for linear complementarity problems, J. Oper. Res. Soc. Japan, 32 (1989), pp. 75-92.
7. R. D. C. MONTEIRO AND I. ADLER, Interior path following primal-dual algorithms: Part I: Linear programming, Math. Programming, 44 (1989), pp. 27-41.
8. YU. E. NESTEROV, Long-step strategies in interior-point primal-dual methods, Math. Programming, 76 (1996), pp. 47-94.
9. YU. E. NESTEROV AND A. S. NEMIROVSKII, Interior Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
10. YU. E. NESTEROV AND M.J. TODD, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res., 22 (1997), pp. 1-42.
11. O. ROTHAUS, Domains of positivity, Abh. Math. Sem. Univ. Hamburg, 24 (1960), pp. 189-235.
12. M.J. TODD, K.-C. TOH, AND R. H. TÜTÜNCÜ, On the Nesterov-Todd Direction in Semidefinite Programming, SIAM J. Optim., 8 (1998), to appear.
13. L. TUNÇEL, Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization, Research report CORR 96-18, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada, 1996.