Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems

In this paper, we establish the local superlinear convergence property of some polynomial-time interior-point methods for an important family of conic optimization problems. The main structural property used in our analysis is the logarithmic homogeneity of self-concordant barrier function, which must have negative curvature. We propose a new path-following predictor-corrector scheme, which works only in the dual space. It is based on an easily computable gradient proximity measure, which ensures an automatic transformation of the global linear rate of convergence to the local superlinear one under some mild assumptions. Our step-size procedure for the predictor step is related to the maximum step size maintaining feasibility. As the optimal solution set is approached, our algorithm automatically tightens the neighborhood of the central path proportionally to the current duality gap.

[1]  Heinz H. Bauschke,et al.  Hyperbolic Polynomials and Convex Analysis , 2001, Canadian Journal of Mathematics.

[2]  Masakazu Kojima,et al.  Local convergence of predictor—corrector infeasible-interior-point algorithms for SDPs and SDLCPs , 1998, Math. Program..

[3]  James Renegar,et al.  Hyperbolic Programs, and Their Derivative Relaxations , 2006, Found. Comput. Math..

[4]  Osman Güler,et al.  Hyperbolic Polynomials and Interior Point Methods for Convex Programming , 1997, Math. Oper. Res..

[5]  Renato D. C. Monteiro,et al.  Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2 , 2005, SIAM J. Optim..

[6]  Yin Zhang,et al.  On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms , 1992, SIAM J. Optim..

[7]  Jun Ji,et al.  On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming , 1999, SIAM J. Optim..

[8]  Renato D. C. Monteiro,et al.  Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming , 2007, Optim. Methods Softw..

[9]  Yurii Nesterov,et al.  Squared Functional Systems and Optimization Problems , 2000 .

[10]  F. Potra,et al.  Superlinear Convergence of a Predictor-corrector Method for Semideenite Programming without Shrinking Central Path Neighborhood , 1996 .

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

[12]  Yin Zhang,et al.  A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programming , 1993, Math. Program..

[13]  Sanjay Mehrotra,et al.  Quadratic Convergence in a Primal-Dual Method , 1993, Math. Oper. Res..

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

[15]  F. Potra,et al.  Superlinear Convergence of Interior-Point Algorithms for Semidefinite Programming , 1998 .

[16]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[17]  Paul Van Dooren,et al.  Optimization Problems over Positive Pseudopolynomial Matrices , 2003, SIAM J. Matrix Anal. Appl..