Bad Semidefinite Programs: They All Look the Same
From MaRDI portal
Publication:2967605
DOI10.1137/15M1041924zbMath1366.90158arXiv1112.1436OpenAlexW3103622948MaRDI QIDQ2967605
Publication date: 1 March 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.1436
semidefinite programmingdualityconic linear programmingclosedness of the linear image of a closed convex conepathological semidefinite programs
Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46) Inequalities and extremum problems involving convexity in convex geometry (52A40) Duality theory (optimization) (49N15)
Related Items
A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, A simplified treatment of Ramana's exact dual for semidefinite programming, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, A complementarity partition theorem for multifold conic systems, Unnamed Item, A note on strict complementarity for the doubly non-negative cone, Conic programming: infeasibility certificates and projective geometry, Preprocessing and Regularization for Degenerate Semidefinite Programs, Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone, Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs, Bad projections of the PSD cone, In SDP Relaxations, Inaccurate Solvers Do Robust Optimization, Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs, Solving SDP completely with an interior point oracle, Exact Duality in Semidefinite Programming Based on Elementary Reformulations, Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facial reduction algorithms for conic optimization problems
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Universal duality in conic convex optimization
- Set intersection theorems and existence of optimal solutions
- New stopping criteria for detecting infeasibility in conic optimization
- Regularizing the abstract convex program
- An exact duality theory for semidefinite programming and its complexity implications
- Convex analysis and nonlinear optimization. Theory and examples
- On Nesterov's approach to semi-infinite programming
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- Strong duality and minimal representations for cone optimization
- On the connection of facially exposed and nice cones
- Generating and measuring instances of hard semidefinite programs
- A complementarity partition theorem for multifold conic systems
- Invariance and efficiency of convex representations
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Lectures on Modern Convex Optimization
- Semidefinite optimization
- On point classification in convex sets.
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Strong Duality for Semidefinite Programming
- Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
- Closedness criteria for the image of a closed set by a inear operator
- Notes on Duality in Second Order and p -Order Cone Optimization
- Semidefinite Programming
- Semidefinite Optimization and Convex Algebraic Geometry
- Facially Exposed Cones Are Not Always Nice
- An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
- On the Closedness of the Linear Image of a Closed Convex Cone
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations
- A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS
- Convex Analysis
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
- Convex analysis and monotone operator theory in Hilbert spaces
