KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions
From MaRDI portal
Publication:2444417
DOI10.1016/j.jfa.2013.10.023zbMath1291.90178OpenAlexW2016029475MaRDI QIDQ2444417
Publication date: 9 April 2014
Published in: Journal of Functional Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfa.2013.10.023
optimality conditionssubdifferentialsKarush-Kuhn-Tucker conditionssupport functionstheorems of the alternative
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tangent cone and contingent cone to the intersection of two closed sets
- Theorems of the alternative and their applications in multiobjective optimization
- Theorems of the alternative for multifunctions with applications to optimization: General results
- The differentiability of real functions on normed linear space using generalized subgradients
- Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative
- A stable theorem of the alternative: An extension of the Gordan theorem
- Generalized Farkas' theorem and optimization of infinitely constrained problems
- Convex analysis and nonlinear optimization. Theory and examples
- A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
- Theorems of the alternative and optimization with set-valued maps
- A theorem of the alternative with application to convex programming: optimality, duality, and stability
- A theorem of the alternative and a two-function minimax theorem
- On theorems of the alternative
- Theorems of the alternative for set-valued functions in infinite-dimensional spaces
- On optimality conditions in nondifferentiable programming
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- A New Approach to Lagrange Multipliers
- Classroom Note:An Elementary Proof of Farkas' Lemma
- Lagrange Multipliers for Nonconvex Generalized Gradients with Equality, Inequality, and Set Constraints
- Small convex-valued subdifferentials in mathematical programming
- A Necessary and Sufficient Qualification for Constrained Optimization
- Transposition Theorems for Cone-Convex Functions
