A robust algorithm for semidefinite programming
From MaRDI portal
Publication:5200556
DOI10.1080/10556788.2011.610456zbMath1274.90257OpenAlexW2087224505MaRDI QIDQ5200556
Henry Wolkowicz, Xuan Vinh Doan, Serge G. Kruk
Publication date: 6 November 2012
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2011.610456
Semidefinite programming (90C22) Interior-point methods (90C51) Preconditioners for iterative methods (65F08)
Related Items
Distributionally robust single machine scheduling with risk aversion, Recent advances in robust optimization: an overview, Preprocessing and Regularization for Degenerate Semidefinite Programs, Error Bounds and Singularity Degree in Semidefinite Programming
Uses Software
Cites Work
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
- An independent benchmarking of SDP and SOCP solvers
- Generating and measuring instances of hard semidefinite programs
- Convergence of a short-step primal-dual algorithm based on the Gauss-Newton direction
- A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Sizing and Least-Change Secant Methods
- The Gauss-Newton direction in semidefinite programming
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On the Shannon capacity of a graph
- 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
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- CSDP, A C library for semidefinite programming
- An Interior-Point Method for Semidefinite Programming
- Regularization Methods for Semidefinite Programming
- Solving semidefinite programs using preconditioned conjugate gradients
- Computational experience with ill-posed problems in semidefinite programming
