Primal-Dual Interior-Point Methods for Self-Scaled Cones

In this paper we continue the development of a theoretical foundation for efficient primal-dual interior-point algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are self-scaled (see Yu. E. Nesterov and M. J. Todd, Math. Oper. Res., 22 (1997), pp. 1--42). The class of problems under consideration includes linear programming, semidefinite programming, and convex quadratically constrained, quadratic programming problems. For such problems we introduce a new definition of affine-scaling and centering directions. We present efficiency estimates for several symmetric primal-dual methods that can loosely be classified as path-following methods. Because of the special properties of these cones and barriers, two of our algorithms can take steps that typically go a large fraction of the way to the boundary of the feasible region, rather than being confined to a ball of unit radius in the local norm defined by the Hessian of the barrier.

[1]  O. Rothaus.  Domains of Positivity , 1958 .

[2]  I. Ekeland,et al.  Convex analysis and variational problems , 1976 .

[3]  H. Weinert.  Ekeland, I. / Temam, R., Convex Analysis and Variational Problems. Amsterdam‐Oxford. North‐Holland Publ. Company. 1976. IX, 402 S., Dfl. 85.00. US $ 29.50 (SMAA 1) , 1979 .

[4]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[5]  R. C. Monteiro,et al.  Interior path following primal-dual algorithms , 1988 .

[6]  S. Mizuno,et al.  PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS , 1989 .

[7]  Shinji Mizuno,et al.  A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..

[8]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..

[9]  Shinji Mizuno,et al.  On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..

[10]  Y. Nesterov,et al.  Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming , 1994 .

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

[12]  Shuzhong Zhang,et al.  Polynomial primal-dual cone affine scaling for semidefinite programming , 1999 .

[13]  Yurii Nesterov,et al.  Long-step strategies in interior-point primal-dual methods , 1997, Math. Program..

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

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

[16]  Shuzhong Zhang,et al.  Duality Results for Conic Convex Programming , 1997 .

[17]  Levent Tunçel,et al.  Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization , 1998, Math. Oper. Res..

[18]  Zhi-Quan Luo,et al.  Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming , 1998, SIAM J. Optim..

[19]  Z. Luo,et al.  Conic convex programming and self-dual embedding , 1998 .

[20]  Kim-Chuan Toh,et al.  On the Nesterov-Todd Direction in Semidefinite Programming , 1998, SIAM J. Optim..