A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
From MaRDI portal
Publication:1821698
DOI10.1007/BF00941180zbMath0616.90072WikidataQ124936022 ScholiaQ124936022MaRDI QIDQ1821698
Publication date: 1987
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
nonsmooth programming; generalized convex function; convex process; nonlinear mappings; characterization of optimality; generalization of the Farkas lemma
90C30: Nonlinear programming
Related Items
A generl farkas type lemma, Duality and infinite dimensional optimization, Inequality systems and optimization, Necessary and sufficient conditions for solving infinite-dimensional linear inequalities, Generalized Motzkin theorems of the alternative and vector optimization problems, A new version of Farkas' lemma and global convex maximization, A Farkas lemma for difference sublinear systems and quasidifferentiable programming, Connectedness of efficient solution sets for set-valued maps in normed spaces, Further generalizations of Farkas' theorem and their applications in optimal control, Asymptotic dual conditions characterizing optimality for infinite convex programs, Results of farkas type
Cites Work
- A general Farkas lemma
- A generalization of the Farkas lemma and applications to convex programming
- Adjoint Process Duality
- Nonlinear alternative theorems and nondifferentiable programming
- Complete characterization of optimality for convex programming in banach spaces†
- A generalized Farkas lemma with applications to quasidifferentiable programming
- Characterizations of optimality without constraint qualification for the abstract convex program
- Semismooth and Semiconvex Functions in Constrained Optimization
- A New Approach to Lagrange Multipliers
- Characterizations of optimality in convex programming: the nondifferentiable case
- The Farkas lemma of Shimizu, Aiyoshi and Katayama
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
