On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization

DOI10.1080/10556780802571392MaRDI QIDQ3562415zbMATH OpenOpenAlexFDO

Authors M. H. Koulaei, Tamás Terlaky

Publication date 21 May 2010

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780802571392

zbMATH Keywords

Mehrotra-type algorithmpolynomial complexitypredictor-corrector algorithmssemidefinite optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization
• A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
• New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming
• New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction
• Large-update primal-dual interior-point algorithm for semidefinite optimization

Cited in

(12)

• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
• Stabilization of Mehrotra's primal-dual algorithm and its implementation
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
• An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
• A primal-dual interior-point algorithm with arc-search for semidefinite programming
• A new second-order Mehrotra-type predictor-corrector algorithm for SDO
• New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming
• A second-order mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
• A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
• Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian P_()-LCP over symmetric cones
• New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction

Describes a project that uses

Uses Software

• SDPT3

This page was built for publication: On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562415)