Polynomial complexity bounds of Mehrotra-type predictor-corrector algorithms for linear programming over symmetric cones

DOI10.13371/J.CNKI.CHIN.Q.J.M.2015.04.001zbMATH Open1349.90841MaRDI QIDQ2994022FDOQ2994022

Authors: Zhenguo Li, Changhe Liu, Youlin Shang 

Publication date: 10 August 2016

Recommendations

• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
• Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
• A Mehrotra-type predictor-corrector algorithm with \(O(\sqrt{n}L)\)-iteration complexity
• A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity

zbMATH Keywords

linear programminginterior point methodspolynomial complexityEuclidean Jordan algebrasymmetric coneMehrotra-type algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Complexity and performance of numerical algorithms (65Y20) Linear programming (90C05) Interior-point methods (90C51)

Cited In (5)

• A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
• A second order infeasible Mehrotra-type predictor-corrector algorithm for linear programming
• On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
• On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones

This page was built for publication: Polynomial complexity bounds of Mehrotra-type predictor-corrector algorithms for linear programming over symmetric cones

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