An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization
DOI10.1080/02331934.2021.1899177zbMATH Open1506.90271OpenAlexW3137614794MaRDI QIDQ5045166FDOQ5045166
Author name not available (Why is that?)
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
Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- On Mehrotra-Type Predictor-Corrector Algorithms
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- 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 primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
- A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
- On the Nesterov--Todd Direction in Semidefinite Programming
- Barrier Functions in Interior Point Methods
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
- On finding a vertex solution using interior point methods
- A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming
- 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 primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity
- A New Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming
This page was built for publication: An O(r(cond(G))1/4log¼ϵ−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)
