New stopping criteria for detecting infeasibility in conic optimization

DOI10.1007/s11590-008-0100-yzbMath1167.90586OpenAlexW2080216751MaRDI QIDQ1024728

Imre Pólik, Tamás Terlaky

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

zbMATH Keywords

approximate Farkas theorem

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items

CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization, How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization, Algebraic connectivity of an even uniform hypergraph, Bad Semidefinite Programs: They All Look the Same, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, Weak infeasibility in second order cone programming, Conic programming: infeasibility certificates and projective geometry, Preprocessing and Regularization for Degenerate Semidefinite Programs, A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor, Solving SDP completely with an interior point oracle, Exact Duality in Semidefinite Programming Based on Elementary Reformulations

Uses Software

• SDPLIB
• DIMACS

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