A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes (Q1821698): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:46, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes |
scientific article |
Statements
A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes (English)
0 references
1987
0 references
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.
0 references
generalization of the Farkas lemma
0 references
nonlinear mappings
0 references
convex process
0 references
generalized convex function
0 references
characterization of optimality
0 references
nonsmooth programming
0 references
