Weak infeasibility in second order cone programming
From MaRDI portal
Publication:518144
DOI10.1007/s11590-015-0982-4zbMath1391.90578arXiv1509.05168OpenAlexW2249602763MaRDI QIDQ518144
Masakazu Muramatsu, Bruno F. Lourenço, Takashi Tsuchiya
Publication date: 28 March 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.05168
Related Items
Facial Reduction and Partial Polyhedrality, Infeasibility detection in the alternating direction method of multipliers for convex optimization, Solving SDP completely with an interior point oracle, Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facial reduction algorithms for conic optimization problems
- New stopping criteria for detecting infeasibility in conic optimization
- Applications of second-order cone programming
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- Solving SDP completely with an interior point oracle
- An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
- On the Closedness of the Linear Image of a Closed Convex Cone
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations
- A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS
- Convex Analysis
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
