A new corrector-predictor interior-point method for symmetric cone optimization
From MaRDI portal
Publication:2678433
Recommendations
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- A corrector-predictor arc search interior-point algorithm for symmetric optimization
- A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
- 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
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?)
- A corrector-predictor interior-point method with new search direction for linear optimization
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- A corrector-predictor path-following method for second-order cone optimization
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A new polynomial-time algorithm for linear programming
- A predictor-corrector algorithm for linearly constrained convex optimization
- A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
- Barrier Functions in Interior Point Methods
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Corrector-predictor methods for sufficient linear complementarity problems
- Extension of primal-dual interior point algorithms to symmetric cones
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- New interior point algorithms in linear programming
- New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On the Implementation of a Primal-Dual Interior Point Method
- On the Nesterov--Todd Direction in Semidefinite Programming
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Similarity and other spectral relations for symmetric cones
Cited in
(4)- A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique
- Corrector-predictor interior-point method with new search direction for semidefinite optimization
- Two wide neighborhood interior-point methods for symmetric cone optimization
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
This page was built for publication: A new corrector-predictor interior-point method for symmetric cone optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2678433)
