A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization
From MaRDI portal
Publication:5238196
DOI10.1080/02331934.2019.1591405zbMath1431.90110OpenAlexW2924672972MaRDI QIDQ5238196
Publication date: 28 October 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1591405
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- First- and second-order methods for semidefinite programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite 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
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- Linear Matrix Inequalities in System and Control Theory
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- On the Convergence of the Central Path in Semidefinite Optimization
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
This page was built for publication: A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization
