Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
From MaRDI portal
Publication:2293657
DOI10.1007/s12532-019-00164-4zbMath1479.90155arXiv1710.08954OpenAlexW2765212321WikidataQ127571403 ScholiaQ127571403MaRDI QIDQ2293657
Gábor Pataki, Yuzixuan Zhu, Quoc Tran Dinh
Publication date: 5 February 2020
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.08954
semidefinite programmingstrong dualitypolynomial optimizationpreprocessingstrict feasibilityfacial reduction
Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)
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, A simplified treatment of Ramana's exact dual for semidefinite programming, Characterization of the dual problem of linear matrix inequality for H-infinity output feedback control problem via facial reduction, Amenable cones: error bounds without constraint qualifications, Numerical algebraic geometry and semidefinite programming, Douglas-Rachford splitting and ADMM for pathological convex optimization, Sieve-SDP, Facially Dual Complete (Nice) Cones and Lexicographic Tangents, Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs, Solving SDP completely with an interior point oracle
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- Solving semidefinite-quadratic-linear programs using SDPT3
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
- Facial reduction algorithms for conic optimization problems
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- A criterion for the half-plane property
- Regularizing the abstract convex program
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- An independent benchmarking of SDP and SOCP solvers
- Semidefinite programming relaxations for semialgebraic problems
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Solving a class of semidefinite programs via nonlinear programming
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
- Global Optimization with Polynomials and the Problem of Moments
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Exact Algorithms for Linear Matrix Inequalities
- Bad Semidefinite Programs: They All Look the Same
- Lyapunov analysis of rigid body systems with impacts and friction via sums-of-squares
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- GloptiPoly 3: moments, optimization and semidefinite programming
- Copositive realxation for genera quadratic programming
- PENNON: A code for convex nonlinear and semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
- Extreme copositive quadratic forms
- Singularity Degree of the Positive Semidefinite Matrix Completion Problem
- Handbook of semidefinite programming. Theory, algorithms, and applications
