A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes

DOI10.1007/BF00941180zbMath0616.90072OpenAlexW1996191470WikidataQ124936022 ScholiaQ124936022MaRDI QIDQ1821698

Vaithilingam Jeyakumar

Publication date: 1987

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00941180

zbMATH Keywords

nonsmooth programminggeneralized convex functionconvex processnonlinear mappingscharacterization of optimalitygeneralization of the Farkas lemma

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (12)

Connectedness of efficient solution sets for set-valued maps in normed spaces ⋮ Necessary and sufficient conditions for solving infinite-dimensional linear inequalities ⋮ Results of farkas type ⋮ Generalized Motzkin theorems of the alternative and vector optimization problems ⋮ Further generalizations of Farkas' theorem and their applications in optimal control ⋮ Asymptotic dual conditions characterizing optimality for infinite convex programs ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Duality and infinite dimensional optimization ⋮ A generl farkas type lemma ⋮ A new version of Farkas' lemma and global convex maximization ⋮ A Farkas lemma for difference sublinear systems and quasidifferentiable programming ⋮ Inequality systems and optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general Farkas lemma
• A generalization of the Farkas lemma and applications to convex programming
• Adjoint Process Duality
• Optimization and nonsmooth analysis
• 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

This page was built for publication: A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes