Error Bounds and Singularity Degree in Semidefinite Programming
From MaRDI portal
Publication:5857289
DOI10.1137/19M1289327zbMath1462.90086arXiv1908.04357OpenAlexW3135424042MaRDI QIDQ5857289
Henry Wolkowicz, Stefan Sremac, Hugo J. Woerdeman
Publication date: 31 March 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.04357
Related Items
A strengthened Barvinok-Pataki bound on SDP rank ⋮ A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms ⋮ Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs ⋮ Revisiting degeneracy, strict feasibility, stability, in linear programming ⋮ On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facial reduction algorithms for conic optimization problems
- A note on alternating projections for ill-posed semidefinite feasibility problems
- Polyhedral and semidefinite programming methods in combinatorial optimization
- On solving trust-region and other regularised subproblems in optimization
- Regularizing the abstract convex program
- The real positive definite completion problem for a simple cycle
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Complementarity and nondegeneracy in semidefinite programming
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- Generating and measuring instances of hard semidefinite programs
- Maximum determinant positive definite Toeplitz completions
- Cubic regularization of Newton method and its global performance
- The variation of the spectrum of a normal matrix
- The Gauss-Newton direction in semidefinite programming
- The Generic Nature of Optimality Conditions in Nonlinear Programming
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- Error Bounds for Linear Matrix Inequalities
- Conic convex programming and self-dual embedding
- A robust algorithm for semidefinite programming
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
- Convex Analysis
- Preprocessing and Regularization for Degenerate Semidefinite Programs
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
- On the identification of the optimal partition for semidefinite optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications