Work

Full-Newton step infeasible interior-point algorithm for SDO problems

Year: 2012
Type: other
Abstract: summary:In this paper we propose a primal-dual path-following interior-point algorithm for semidefinite optimization. The algorithm constructs strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem. Each main step of the algorithm consists of a feasibility step and several centering steps. At each iteration, we use only full-Newton step. Moreover, we use a more natural feasibility step, which targets at the $\mu^+$-center. The iteration bound of the algorithm coincides with the currently best iteration bound for semidefinite optimization problems.
Author: H. Mansouri
Language: English
Open Access status: green
OpenAlex ID: W1799088123
Cites: 20
Cited by: 6
Related to: 10