Generating and measuring instances of hard semidefinite programs
From MaRDI portal
Publication:1960189
DOI10.1007/s10107-008-0256-3zbMath1198.90317OpenAlexW2035164723MaRDI QIDQ1960189
Publication date: 13 October 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0256-3
strict complementarityprimal-dual interior-point methodscomplementarity nullityhard numerical instances
Related Items
Strong duality and minimal representations for cone optimization, On the complexity of analyticity in semi-definite optimization, Bad Semidefinite Programs: They All Look the Same, Preprocessing and Regularization for Degenerate Semidefinite Programs, Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity, A robust algorithm for semidefinite programming, Error Bounds and Singularity Degree in Semidefinite Programming
Uses Software
Cites Work
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
- Regularizing the abstract convex program
- Some perturbation theory for linear programming
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Linear programming, complexity theory and elementary functional analysis
- Computing Symmetric Rank-Revealing Decompositions via Triangular Factorization
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Interior Point Trajectories in Semidefinite Programming
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- On the Convergence of the Central Path in Semidefinite Optimization
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- Updating a Rank-Revealing ULV Decomposition
- Solving semidefinite programs using preconditioned conjugate gradients
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Inequalities: theory of majorization and its applications
