A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
DOI10.1080/10556788.2018.1528248zbMath1407.90345OpenAlexW2898622871WikidataQ129075160 ScholiaQ129075160MaRDI QIDQ4622888
No author found.
Publication date: 18 February 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2018.1528248
euclidean Jordan algebrasymmetric cone optimizationpredictor-corrector interior-point algorithmlarge neighbourhood of the central pathNesterov-Todd directions
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
- 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
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- A Mathematical View of Interior-Point Methods in Convex Optimization
- 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
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On the Nesterov--Todd Direction in Semidefinite Programming
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Conic convex programming and self-dual embedding
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- A Jordan-algebraic approach to potential-reduction algorithms
- Benchmarking optimization software with performance profiles.
This page was built for publication: A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
