Solving SDP completely with an interior point oracle
From MaRDI portal
Publication:4999336
DOI10.1080/10556788.2020.1850720zbMath1470.90066arXiv1507.08065OpenAlexW3128670379MaRDI QIDQ4999336
Takashi Tsuchiya, Masakazu Muramatsu, Bruno F. Lourenço
Publication date: 6 July 2021
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.08065
semidefinite programmingfeasibility problemfacial reductionconic linear programmingdouble facial reduction
Semidefinite programming (90C22) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)
Related Items
A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms, A new extension of Chubanov's method to symmetric cones, Weak infeasibility in second order cone programming, Douglas-Rachford splitting and ADMM for pathological convex optimization, A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs, Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem, 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
- Facial reduction algorithms for conic optimization problems
- Weak infeasibility in second order cone programming
- On the duality operator of a convex cone
- New stopping criteria for detecting infeasibility in conic optimization
- Regularizing the abstract convex program
- On the complexity of semidefinite programs
- 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
- A unified class of directly solvable semidefinite programming problems
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Cones of diagonally dominant matrices
- Explicit solutions for interval semidefinite linear programs
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- Strong duality and minimal representations for cone optimization
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- Amenable cones: error bounds without constraint qualifications
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- A bound on the Carathéodory number
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- Exact Algorithms for Linear Matrix Inequalities
- Bad Semidefinite Programs: They All Look the Same
- Projections of Convex Programs with Unattained Infima
- Strong Duality for Semidefinite Programming
- On homogeneous interrior-point algorithms for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Error Bounds for Linear Matrix Inequalities
- Conic convex programming and self-dual embedding
- Facial Reduction and Partial Polyhedrality
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- The Simplest Semidefinite Programs are Trivial
- Primal-Dual Interior-Point Methods for Domain-Driven Formulations
- An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
- Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations
- 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
