A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
type: Item
instance of: scholarly article
title: A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
zbMATH Open document ID: 0616.90072
DOI: 10.1007/BF00941180
published in: Journal of Optimization Theory and Applications
publication date: 1987-01-01T00:00:00Z
review text: In this paper, a generalization of the Farkas lemma is presented for nonlinear mappings which involve a convex process and a generalized convex function. Using this result, a complete characterization of optimality is obtained for the following nonsmooth programming problem: minimize f(x), subject to -b\(\in H(x)\), where f is a locally Lipschitz function satisfying a generalized convexity hypothesis and H is a closed convex process.
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 3999682
zbMATH Keywords: generalization of the Farkas lemma
zbMATH Keywords: nonlinear mappings
zbMATH Keywords: convex process
zbMATH Keywords: generalized convex function
zbMATH Keywords: characterization of optimality
zbMATH Keywords: nonsmooth programming
author: V. Jeyakumar
MaRDI profile type: Publication
Wikidata QID: Q124936022
cites work: A generalized Farkas lemma with applications to quasidifferentiable programming
cites work: A general Farkas lemma
cites work: The Farkas lemma of Shimizu, Aiyoshi and Katayama
cites work: A generalization of the Farkas lemma and applications to convex programming
cites work: Nonlinear alternative theorems and nondifferentiable programming
cites work: Q3869074
cites work: Optimization and nonsmooth analysis
cites work: Convex Analysis
cites work: Adjoint Process Duality
cites work: Complete characterization of optimality for convex programming in banach spaces†
cites work: Characterizations of optimality without constraint qualification for the abstract convex program
cites work: A New Approach to Lagrange Multipliers
cites work: Q4050397
cites work: Semismooth and Semiconvex Functions in Constrained Optimization
cites work: Q4104377
cites work: Characterizations of optimality in convex programming: the nondifferentiable case
full work available at URL: https://doi.org/10.1007/bf00941180
OpenAlex ID: W1996191470
description: scientific article; zbMATH DE number 3999682