A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
From MaRDI portal
Publication:501263
Recommendations
- Generalized Farkas lemma and optimality conditions for nonconvex semidefinite programming
- Stable Farkas lemmas and duality for nonconvex composite semi-infinite programming problems
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
- Generic primal-dual solvability in continuous linear semi-infinite programming
- Duality and a Farkas lemma for integer programs
- An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition
- Constraint qualifications and Farkas lemma in convex infinite programming
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- An easy path to convex analysis and applications
- Characterizing robust local error bounds for linear inequality systems under data uncertainty
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Graph implementations for nonsmooth convex programs
- Polytopes, Rings, and K-Theory
- Recent contributions to linear semi-infinite optimization
- Robust global error bounds for uncertain linear inequality systems with applications
- Semidefinite Optimization and Convex Algebraic Geometry
- Some geometric results in semidefinite programming
- What is \dots a spectrahedron?
Cited in
(16)- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
- Generalized Farkas lemma with adjustable variables and two-stage robust linear programs
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
- Recent contributions to linear semi-infinite optimization: an update
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- A note on a matrix version of the Farkas lemma
- Recent contributions to linear semi-infinite optimization
- A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs
- Exact relaxations for parametric robust linear optimization problems
- Stability properties for parametric linear programs under data ambiguities
- Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization
- An exact duality theory for semidefinite programming based on sums of squares
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)
