A primal-dual predictor-corrector interior-point method for symmetric cone programming with O (r ^-1) iteration complexity
From MaRDI portal
Publication:3174878
Recommendations
- A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
- 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
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
Cites work
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- A Jordan-algebraic approach to potential-reduction algorithms
- A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- 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 full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- An \(O(\sqrt n L)\) iteration primal-dual path-following method, based on wide neighbourhood and large update, for second-order cone programming
- Barrier Functions in Interior Point Methods
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Neighborhood-following algorithms for linear programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On Mehrotra-Type Predictor-Corrector Algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- 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
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
Cited in
(15)- A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones
- A new \(O(\sqrt nL)\) iteration large-update primal-dual interior-point method for second-order cone programming
- A polynomial-time inexact interior-point method for convex quadratic symmetric cone programming
- 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
- On Hazan's algorithm for symmetric programming problems
- A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
- Polynomial complexity bounds of Mehrotra-type predictor-corrector algorithms for linear programming over symmetric cones
- An interior-point method for symmetric optimization based on a new wide neighborhood
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
- Curvature integrals and iteration complexities in SDP and symmetric cone programs
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
This page was built for publication: A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174878)
