Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization

DOI10.1007/s11750-014-0315-2zbMath1301.49001OpenAlexW1996223325MaRDI QIDQ5965675

Boris S. Mordukhovich

Publication date: 8 October 2014

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-014-0315-2

zbMATH Keywords

optimizationconvex programmingvariational analysisgeneralized differentiationFarkas' lemmasemiinfinite programming

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Semi-infinite programming (90C34) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)

Related Items (2)

A discrete variant of Farkas' lemma ⋮ A discrete variant of Farkas' lemma and related results

Cites Work

• Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
• Quantitative stability of linear infinite inequality systems under block perturbations with applications to convex systems
• Second-Order Analysis of Polyhedral Systems in Finite and Infinite Dimensions with Applications to Robust Stability of Variational Inequalities
• Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions
• Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
• A Short Algebraic Proof of the Farkas Lemma
• Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data

This page was built for publication: Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization