Polynomial convergence of infeasible-interior-point methods over symmetric cones

SIAM Journal on Optimization

Volumn 16, Issue 4, 2006, Pages 1211-1229

  Rangarajan, Bharath Kumar ^a,b  

^a Cornell University   (United States)

^b University of Minnesota   (United States)

Author keywords

Conic programming; Euclidean jordan algebras; Infeasible interior point methods; Semidefinite programming; Symmetric cones

Indexed keywords

CONIC PROGRAMMING; EUCLIDEAN JORDAN ALGEBRAS; INFEASIBLE-INTERIOR-POINT METHODS; SEMIDEFINITE PROGRAMMING; SYMMETRIC CONES;

LINEAR PROGRAMMING; LYAPUNOV METHODS; OPTIMIZATION; POLYNOMIALS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 33750901458     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/040606557     Document Type: Article

References (14)

1. J. FARAUT AND A. KORANVI, Analysis on Symmetric Cones, Oxford University Press, New York, 1994.
2. L. FAYBUSOVICH, Linear systems in Jordan algebras and primal-dual interior-point algorithms, J. Comput. Appl. Math., 86 (1997), pp. 149-175.
3. O. GÜLER, Barrier functions in interior point methods. Math. Oper. Res., 21 (1996), pp. 860-885.
4. P. JORDAN, J. VON NEUMANN, AND E. WIGNER, On an algebraic generalization of the quantum mechanical formalism, Ann. of Math. (2), 35 (1934), pp. 29-64.
5. M. KOECHER, The Minnesota Notes on Jordan Algebras and Their Applications, Lecture Notes in Math. 1710, A. Krieg and S. Walcher eds., Springer-Verlag, Berlin, 1999.
6. I. J. LUSTIG, R. MARSTEN, AND D. F. SHANNO, Computational experience, with a primal-dual interior point method for linear programming, Linear Algebra Appl., 152 (1991), pp. 191-222.
7. R. D. C. MONTEIRO AND Y. ZHANG, A unified analysis for a class of path-following primal-dual path-following interior-point algorithms for semidefinite programming, Math. Program., 81 (1998), pp. 281-299.
8. YU. E. NESTEROV AND A. S. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, 1994.
9. 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.
10. B. RANGARAJAN AND M. J. TODD, Convergence of Infeasible-interior-point Methods for Self-scaled Conic Programming, Tech. report 1388, School of OR & IE, Cornell University, Ithaca, NY, 2003.
11. S. H. SCHMIETA AND F. ALIZADEH, Extension of primal-dual interior point algorithm to symmetric cones, Math. Program., 96 (2003), pp. 409-438.
12. J. F. STURM, Similarity and other spectral relations for symmetric cones, Linear Algebra Appl., 312 (2000), pp. 135-154.
13. Y. ZHANG, On the convergence of a class of infeasible-interior-point methods for the horizontal linear complementarity problem, SIAM J. Optim., 4 (1994), pp. 208-227.
14. Y. ZHANG, On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM J. Optim., 8 (1998), pp. 365-386.