A new O(nL) -iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming

Authors:
Zengzhe Feng;Liang Fang
Affiliations:
-;-
Venue:
Journal of Computational and Applied Mathematics
Year:
2014

Citing 16
Cited 0

Topics in matrix analysis

Topics in matrix analysis
A class of projective transformations for linear programming

SIAM Journal on Computing
On adaptive-step primal-dual interior-point algorithms for linear programming

Mathematics of Operations Research
On quadratic and OnL convergence of a predictor-corrector algorithm for LCP

Mathematical Programming: Series A and B
Semidefinite programming

SIAM Review
A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming

Mathematical Programming: Series A and B
On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming

SIAM Journal on Optimization
Primal-Dual Interior-Point Methods for Self-Scaled Cones

SIAM Journal on Optimization
Primal--Dual Path-Following Algorithms for Semidefinite Programming

SIAM Journal on Optimization
Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path

SIAM Journal on Optimization
On the Nesterov--Todd Direction in Semidefinite Programming

SIAM Journal on Optimization
Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results

SIAM Journal on Optimization
A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with *-iteration complexity

Mathematical Programming: Series A and B
A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function

SIAM Journal on Optimization
An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP

SIAM Journal on Optimization
A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity

SIAM Journal on Optimization

Quantified Score

Hi-index	7.29

Visualization

Abstract

In this paper, we extend the Ai-Zhang predictor-corrector method to the class of semidefinite programming. First, we define a new wide neighborhood N(@t,@b). Another key ingredient of our method is that we treat the classical Newton direction as the sum of two other directions, corresponding to respectively the negative part and the positive part of the right-hand-side. We prove that, besides the predictor steps, each corrector step also reduces the duality gap by a rate of 1-1O(n). Then the method enjoys the low iteration bound of O(nL), which is better than that of usual wide neighborhood algorithm O(nL), where n is the dimension of the problem and L=(X^0)^T*S^0@e with @e the required precision and (X^0,y^0,S^0) the initial interior solution.