A new O( nL) iteration large-update primal-dual interior-point method for second-order cone programming
From MaRDI portal
Publication:2895672
Recommendations
- An \(O(\sqrt n L)\) iteration primal-dual path-following method, based on wide neighbourhood and large update, for second-order cone programming
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
- A primal-dual infeasible interior-point algorithm for second-order cone programming
Cites work
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- Applications of second-order cone programming
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Neighborhood-following algorithms for linear programming
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On the Nesterov--Todd Direction in Semidefinite Programming
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Second-order cone programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Cited in
(12)- 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 new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
- An \(O(\sqrt n L)\) iteration primal-dual path-following method, based on wide neighbourhood and large update, for second-order cone programming
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
- A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- Two wide neighborhood interior-point methods for symmetric cone optimization
- A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem
- A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
This page was built for publication: A new \(O(\sqrt nL)\) iteration large-update primal-dual interior-point method for second-order cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895672)
