A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals

DOI10.1016/j.laa.2016.11.008zbMath1352.90060OpenAlexW2551542357WikidataQ124984360 ScholiaQ124984360MaRDI QIDQ501263

Thai Doan Chuong, Vaithilingam Jeyakumar

Publication date: 29 December 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.11.008

zbMATH Keywords

linear inequality constraintsFarkas lemmadual characterizationlinear semi-infinite

Mathematics Subject Classification ID

Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Semi-infinite programming (90C34)

Related Items

Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints ⋮ Conic linear programming duals for classes of quadratic semi-infinite programs with applications ⋮ Recent contributions to linear semi-infinite optimization ⋮ Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems ⋮ Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications ⋮ Unnamed Item ⋮ Generalized Farkas lemma with adjustable variables and two-stage robust linear programs ⋮ Exact relaxations for parametric robust linear optimization problems ⋮ A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints ⋮ Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty

Uses Software

• Matlab
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Farkas' lemma: three decades of generalizations for mathematical optimization
• Characterizing robust local error bounds for linear inequality systems under data uncertainty
• Robust global error bounds for uncertain linear inequality systems with applications
• Recent contributions to linear semi-infinite optimization
• Some geometric results in semidefinite programming
• WHAT IS...a Spectrahedron?
• Graph Implementations for Nonsmooth Convex Programs
• Polytopes, Rings, and K-Theory
• Semidefinite Optimization and Convex Algebraic Geometry
• Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization