Superlinear Convergence of a Predictor-corrector Method for Semideenite Programming without Shrinking Central Path Neighborhood
نویسندگان
چکیده
An infeasible start predictor-corrector algorithm for semideenite programming is proposed. It is a direct extension of the Mizuno-Todd-Ye predictor-corrector algorithm for linear programming. The algorithm uses the
منابع مشابه
On a General Class of Interior-point Algorithms for Semideenite Programming with Polynomial Complexity and Superlinear Convergence
We propose a uniied analysis for a class of infeasible-start predictor-corrector algorithms for semideenite programming problems, using the Monteiro-Zhang uniied direction. The algorithms are direct generalizations of the Mizuno-Todd-Ye predictor-corrector algorithm for linear programming. We show that the algorithms belonging to this class are globally convergent, provided the problem has a so...
متن کاملA Constraint-reduced Algorithm for Semidefinite Optimization Problems using HKM and AHO directions
We develop a new constraint-reduced infeasible predictor-corrector interior point method for semidefinite programming, and we prove that it has polynomial global convergence and superlinear local convergence. While the new algorithm uses HKM direction in predictor step, it adopts AHO direction in corrector step to achieve a faster approach to the central path. In contrast to the previous constr...
متن کاملA Constraint-Reduced Algorithm for Semidefinite Optimization Problems with Superlinear Convergence
Constraint reduction is an essential method because the computational cost of the interior point methods can be effectively saved. Park and O’Leary proposed a constraint-reduced predictor-corrector algorithm for semidefinite programming with polynomial global convergence, but they did not show its superlinear convergence. We first develop a constraintreduced algorithm for semidefinite programmi...
متن کاملCorrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path
In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...
متن کاملOn the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
We study the local convergence of a predictor-corrector algorithm for semideenite programming problems based on the Monteiro-Zhang uniied direction whose polynomial convergence was recently established by Monteiro. We prove that the suucient condition for superlinear convergence of Potra and Sheng applies to this algorithm and is independent of the scaling matrices. Under strict complementarity...
متن کامل