Facial reduction algorithms for conic optimization problems
From MaRDI portal
Publication:368590
DOI10.1007/s10957-012-0219-yzbMath1272.90048OpenAlexW2065957732MaRDI QIDQ368590
Hayato Waki, Masakazu Muramatsu
Publication date: 23 September 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0219-y
Related Items (36)
On equivalent representations and properties of faces of the cone of copositive matrices ⋮ CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ A bound on the Carathéodory number ⋮ A facial reduction algorithm for finding sparse SOS representations ⋮ Facial Reduction and Partial Polyhedrality ⋮ A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization ⋮ A simplified treatment of Ramana's exact dual for semidefinite programming ⋮ How Do Exponential Size Solutions Arise in Semidefinite Programming? ⋮ Bad Semidefinite Programs: They All Look the Same ⋮ Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming ⋮ A relaxed-certificate facial reduction algorithm based on subspace intersection ⋮ 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 ⋮ Refining the partition for multifold conic optimization problems ⋮ A note on alternating projections for ill-posed semidefinite feasibility problems ⋮ Weak infeasibility in second order cone programming ⋮ Conic programming: infeasibility certificates and projective geometry ⋮ Application of facial reduction to H ∞ state feedback control problem ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ Perturbation analysis of singular semidefinite programs and its applications to control problems ⋮ Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone ⋮ Polyhedral approximations of the semidefinite cone and their application ⋮ Douglas-Rachford splitting and ADMM for pathological convex optimization ⋮ Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs ⋮ Limitations on the Expressive Power of Convex Cones without Long Chains of Faces ⋮ A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs ⋮ 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 ⋮ Exact Duality in Semidefinite Programming Based on Elementary Reformulations ⋮ Error Bounds and Singularity Degree in Semidefinite Programming ⋮ Coordinate Shadows of Semidefinite and Euclidean Distance Matrices ⋮ Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyhedral and semidefinite programming methods in combinatorial optimization
- A facial reduction algorithm for finding sparse SOS representations
- Regularizing the abstract convex program
- An exact duality theory for semidefinite programming and its complexity implications
- Graph partitioning using linear and semidefinite programming
- An independent benchmarking of SDP and SOCP solvers
- Semidefinite programming relaxations for semialgebraic problems
- Sparsity in sums of squares of polynomials
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- On the connection of facially exposed and nice cones
- Semidefinite programming relaxations for the graph partitioning problem
- Global Optimization with Polynomials and the Problem of Moments
- AN EXTENSION OF THE ELIMINATION METHOD FOR A SPARSE SOS POLYNOMIAL(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions))
- Semidefinite optimization
- Interior Point Methods for Nonlinear Optimization
- Strong Duality for Semidefinite Programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Convex Analysis
This page was built for publication: Facial reduction algorithms for conic optimization problems
