New stopping criteria for detecting infeasibility in conic optimization
From MaRDI portal
Publication:1024728
DOI10.1007/s11590-008-0100-yzbMath1167.90586MaRDI QIDQ1024728
Publication date: 17 June 2009
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-008-0100-y
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- Characterization of the barrier parameter of homogeneous convex cones
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Lectures on Modern Convex Optimization
- SDPLIB 1.2, a library of semidefinite programming test problems
- Conic convex programming and self-dual embedding