On Minty variational principle for nonsmooth vector optimization problems with approximate convexity (Q279827)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On Minty variational principle for nonsmooth vector optimization problems with approximate convexity |
scientific article; zbMATH DE number 6575205
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Minty variational principle for nonsmooth vector optimization problems with approximate convexity |
scientific article; zbMATH DE number 6575205 |
Statements
On Minty variational principle for nonsmooth vector optimization problems with approximate convexity (English)
0 references
29 April 2016
0 references
The authors extend the concept of approximately convex functions, introduced by \textit{Huynh Van Ngai} et al. [J. Nonlinear Convex Anal. 1, No. 2, 155--176 (2000; Zbl 1033.49029)], to vector functions and study vector optimization problems involving Lipschitz approximately convex data. They characterize approximate efficient solutions by means of solutions to vector variational inequalities of Minty and Stampacchia types.
0 references
approximately convex function
0 references
non smooth vector optimization
0 references
approximate efficient solution
0 references
vector variational inequality
0 references
0 references
0 references
