Facial Reduction and Partial Polyhedrality
From MaRDI portal
Publication:4586172
DOI10.1137/15M1051634zbMath1401.90259arXiv1512.02549OpenAlexW2963285451MaRDI QIDQ4586172
Masakazu Muramatsu, Bruno F. Lourenço, Takashi Tsuchiya
Publication date: 12 September 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.02549
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Convex functions and convex programs in convex geometry (52A41) Duality theory (optimization) (49N15)
Related Items
Kurdyka-Łojasiewicz exponent via inf-projection, 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, Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, Amenable cones: error bounds without constraint qualifications, Refining the partition for multifold conic optimization problems, Facially Dual Complete (Nice) Cones and Lexicographic Tangents, Solving SDP completely with an interior point oracle
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Facial reduction algorithms for conic optimization problems
- Weak infeasibility in second order cone programming
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Regularizing the abstract convex program
- Finding an interior point in the optimal face of linear programs
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- A relaxed-certificate facial reduction algorithm based on subspace intersection
- Strong duality and minimal representations for cone optimization
- A bound on the Carathéodory number
- On polyhedral extension of some LP theorems
- Polyhedral extensions of some theorems of linear programming
- Error Bounds for Linear Matrix Inequalities
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
- A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS
- Preprocessing and Regularization for Degenerate Semidefinite Programs
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
- Handbook of semidefinite programming. Theory, algorithms, and applications
