Facial reduction algorithms for conic optimization problems
From MaRDI portal
Publication:368590
DOI10.1007/s10957-012-0219-yzbMath1272.90048MaRDI 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
90C22: Semidefinite programming
Related Items
Facial Reduction and Partial Polyhedrality, Solving SDP completely with an interior point oracle, On equivalent representations and properties of faces of the cone of copositive matrices, Refining the partition for multifold conic optimization problems, Limitations on the Expressive Power of Convex Cones without Long Chains of Faces, Facially Dual Complete (Nice) Cones and Lexicographic Tangents, Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs, Coordinate Shadows of Semidefinite and Euclidean Distance Matrices, Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach, Exact Duality in Semidefinite Programming Based on Elementary Reformulations, Application of facial reduction to H ∞ state feedback control problem, Validating numerical semidefinite programming solvers for polynomial invariants, Error Bounds and Singularity Degree in Semidefinite Programming, 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, How Do Exponential Size Solutions Arise in Semidefinite Programming?, CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization, A note on alternating projections for ill-posed semidefinite feasibility problems, Weak infeasibility in second order cone programming, A facial reduction algorithm for finding sparse SOS representations, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, A relaxed-certificate facial reduction algorithm based on subspace intersection, Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone, Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization, Numerical algebraic geometry and semidefinite programming, Conic programming: infeasibility certificates and projective geometry, Perturbation analysis of singular semidefinite programs and its applications to control problems, Polyhedral approximations of the semidefinite cone and their application, 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, Douglas-Rachford splitting and ADMM for pathological convex optimization, Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs, A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs, A bound on the Carathéodory number, A simplified treatment of Ramana's exact dual for semidefinite programming, Bad Semidefinite Programs: They All Look the Same
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
