A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
DOI10.1016/J.LAA.2016.11.008zbMATH Open1352.90060OpenAlexW2551542357WikidataQ124984360 ScholiaQ124984360MaRDI QIDQ501263FDOQ501263
V. Jeyakumar, Thai Doan Chuong
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
Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46) Semidefinite programming (90C22) Semi-infinite programming (90C34)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polytopes, Rings, and K-Theory
- Graph Implementations for Nonsmooth Convex Programs
- Semidefinite Optimization and Convex Algebraic Geometry
- Farkas' lemma: three decades of generalizations for mathematical optimization
- What is \dots a spectrahedron?
- Some geometric results in semidefinite programming
- Recent contributions to linear semi-infinite optimization
- Comments on: ``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
Cited In (14)
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
- Generalized Farkas lemma with adjustable variables and two-stage robust linear programs
- Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications
- Exact relaxations for parametric robust linear optimization problems
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
- Recent contributions to linear semi-infinite optimization
- Stability properties for parametric linear programs under data ambiguities
- A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
- Title not available (Why is that?)
- Recent contributions to linear semi-infinite optimization: an update
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Generalized S-lemma and strong duality in nonconvex quadratic programming 👍 👎
- Duality and a Farkas lemma for integer programs 👍 👎
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming 👍 👎
- Generic primal-dual solvability in continuous linear semi-infinite programming 👍 👎
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes 👍 👎
- An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition 👍 👎
This page was built for publication: A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501263)
