An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
From MaRDI portal
Publication:520262
DOI10.1007/s40314-015-0220-9zbMath1359.90153OpenAlexW2008170432MaRDI QIDQ520262
Publication date: 3 April 2017
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-015-0220-9
Related Items
A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation ⋮ A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization ⋮ Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- A primal-dual potential reduction method for problems involving matrix inequalities
- A new second-order corrector interior-point algorithm for semidefinite programming
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- Neighborhood-following algorithms for linear programming
- A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
- 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
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- On the Implementation of a Primal-Dual Interior Point Method
- Linear Matrix Inequalities in System and Control Theory
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- On the Convergence of the Central Path in Semidefinite Optimization
- An Interior-Point Method for Semidefinite Programming
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- An iteration primal–dual path-following method, based on wide neighbourhood and large update, 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
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
