An O(r(cond(G))^1 / 4 ^- 1) iteration predictor-corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization

DOI10.1080/02331934.2021.1899177MaRDI QIDQ5045166zbMATHOpenAlexFDO

Authors

Publication date 4 November 2022

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

Euclidean Jordan algebracomplexity boundone-norminterior-point methodsymmetric cone optimization

Mathematics Subject Classification ID

Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
• A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
• An \(\mathcal{O}\sqrt{n}L)\) predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood
• A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
• A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization

Cites work

• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
• A new \(O(\sqrt nL)\) iteration large-update primal-dual interior-point method for second-order cone programming
• A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
• A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
• A new wide neighborhood primal-dual predictor-corrector interior-point method for linear programming
• A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
• A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
• A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
• Barrier Functions in Interior Point Methods
• Extension of primal-dual interior point algorithms to symmetric cones
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• On Mehrotra-Type Predictor-Corrector Algorithms
• On finding a vertex solution using interior point methods
• On the Nesterov--Todd Direction in Semidefinite Programming
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
• Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Two wide neighborhood interior-point methods for symmetric cone optimization

Cited in

(6)

• A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
• A second-order corrector infeasible interior-point method with one-norm wide neighborhood for symmetric optimization
• A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
• A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
• A corrector-predictor arc search interior-point algorithm for symmetric optimization
• Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions

This page was built for publication: An \(\operatorname{O}(\sqrt{r}(\operatorname{cond}(G))^{1 / 4}\log \varepsilon^{- 1})\) iteration predictor-corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization

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