Generating and measuring instances of hard semidefinite programs
From MaRDI portal
Publication:1960189
DOI10.1007/S10107-008-0256-3zbMATH Open1198.90317OpenAlexW2035164723MaRDI QIDQ1960189FDOQ1960189
Authors: Hua Wei, Henry Wolkowicz 
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
Recommendations
- An exact duality theory for semidefinite programming and its complexity implications
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Computational experience with ill-posed problems in semidefinite programming
- Strong Duality for Semidefinite Programming
- Semidefinite programming and matrix scaling over the semidefinite cone.
primal-dual interior-point methodsstrict complementaritycomplementarity nullityhard numerical instances
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- Solving semidefinite-quadratic-linear programs using SDPT3
- Inequalities: theory of majorization and its applications
- Some perturbation theory for linear programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Computing symmetric rank-revealing decompositions via triangular factorization
- Regularizing the abstract convex program
- On the Convergence of the Central Path in Semidefinite Optimization
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- Linear programming, complexity theory and elementary functional analysis
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- Superlinear convergence of a predictor-corrector method for semidefinite programming without shrinking central path neighborhood
- Interior Point Trajectories in Semidefinite Programming
- Updating a Rank-Revealing ULV Decomposition
- Solving semidefinite programs using preconditioned conjugate gradients
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
Cited In (12)
- A robust algorithm for semidefinite programming
- Preprocessing and regularization for degenerate semidefinite programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strong duality and minimal representations for cone optimization
- Generating hard instances for robust combinatorial optimization
- Title not available (Why is that?)
- Error bounds and singularity degree in semidefinite programming
- Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments
- Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
- Bad semidefinite programs: they all look the same
- On the complexity of analyticity in semi-definite optimization
Uses Software
This page was built for publication: Generating and measuring instances of hard semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1960189)
