Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

We establish polynomial-time convergence of infeasible-interior-point methods for conic programs over symmetric cones using a wide neighborhood of the central path. The convergence is shown for a commutative family of search directions used in Schmieta and Alizadeh [Math. Program., 96 (2003), pp. 409-438]. Monteiro and Zhang [Math. Program., 81 (1998), pp. 281-299] introduced this family of directions when analyzing semidefinite programs. These conic programs include linear and semidefinite programs. This extends the work of Rangarajan and Todd [Tech. rep. 1388, School of OR & IE, Cornell University, Ithaca, NY, 2003], which established convergence of infeasible-interior-point methods for self-scaled conic programs using the NT direction. Our work is built on earlier analyses by Faybusovich [J. Comput. Appl. Math., 86 (1997), pp. 149-175] and Schmieta and Alizadeh [Math. Program., 96 (2003), pp. 409-438]. Of independent interest, we provide a constructive proof of Lyapunov lemma in the Jordan algebraic se...

[1]  Michael J. Todd,et al.  Convergence of infeasible-interior-point methods for self-scaled conic programming , 2003 .

[2]  J. Neumann,et al.  On an Algebraic generalization of the quantum mechanical formalism , 1934 .

[3]  Osman Güler,et al.  Barrier Functions in Interior Point Methods , 1996, Math. Oper. Res..

[4]  Yin Zhang,et al.  On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem , 1994, SIAM J. Optim..

[5]  Michael J. Todd,et al.  Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..

[6]  I. Lustig,et al.  Computational experience with a primal-dual interior point method for linear programming , 1991 .

[7]  Yin Zhang,et al.  A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming , 1998, Math. Program..

[8]  Yin Zhang,et al.  On Extending Some Primal-Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming , 1998, SIAM J. Optim..

[9]  L. Faybusovich.  Linear systems in Jordan algebras and primal-dual interior-point algorithms , 1997 .

[10]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[11]  J. Sturm.  Similarity and other spectral relations for symmetric cones , 2000 .

[12]  Farid Alizadeh,et al.  Extension of primal-dual interior point algorithms to symmetric cones , 2003, Math. Program..