Abstract
In these comments on the excellent survey by Dinh and Jeyakumar, we briefly discuss some recently developed topics and results on applications of extended Farkas' lemma(s) and related qualification conditions to problems of variational analysis and optimization, which are not fully reflected in the survey. They mainly concern: Lipschitzian stability of feasible solution maps for parameterized semi-infinite and infinite programs with linear and convex inequality constraints indexed by arbitrary sets; optimality conditions for nonsmooth problems involving such constraints; evaluating various subdifferentials of optimal value functions in DC and bilevel infinite programs with applications to Lipschitz continuity of value functions and optimality conditions; calculating and estimating normal cones to feasible solution sets for nonlinear smooth as well as nonsmooth semi-infinite, infinite, and conic programs with deriving necessary optimality conditions for them; calculating coderivatives of normal cone mappings for convex polyhedra in finite and infinite dimensions with applications to robust stability of parameterized variational inequalities. We also give some historical comments on the original Farkas' papers.
| Original language | English |
|---|---|
| Pages (from-to) | 31-37 |
| Number of pages | 7 |
| Journal | TOP |
| Volume | 22 |
| Issue number | 1 |
| DOIs | |
| State | Published - Apr 2014 |
Bibliographical note
Funding Information:This research was supported by the US National Science Foundation under grant DMS-1007132 and by the Australian Research Council under grant DP-12092508.
Keywords
- Convex programming
- Farkas' lemma
- Generalized differentiation
- Semi-infinite programming
- Variational analysis and optimization
ASJC Scopus subject areas
- Modeling and Simulation
- Discrete Mathematics and Combinatorics
- Management Science and Operations Research
- Information Systems and Management