Vector critical points and cone efficiency in nonsmooth vector optimization (Q2233604)
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: Vector critical points and cone efficiency in nonsmooth vector optimization |
scientific article; zbMATH DE number 7408205
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vector critical points and cone efficiency in nonsmooth vector optimization |
scientific article; zbMATH DE number 7408205 |
Statements
Vector critical points and cone efficiency in nonsmooth vector optimization (English)
0 references
11 October 2021
0 references
Vector critical points in the senses of Fritz John and Karush-Kuhn-Tucker as well as weakly \(K\)-efficient and \(K\)-efficient solutions to nonsmooth vector optimization problems with cone and equality constraints are studied in the situation when each component of the involved functions is locally Lipschitz continuous under cone-\(FJ\)-pseudo-invexity and cone-\(KT\)-pseudo-invexity hypotheses and via the Clarke generalized gradient for vector-valued functions, respectively.
0 references
nonsmooth mutiobjective programming
0 references
vector critical point
0 references
(weakly) efficiency
0 references
nonsmooth cone-\(FJ\)-pseudo-invexity
0 references
nonsmooth cone-\(KT\)-pseudo-invexity
0 references
optimality conditions
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.93609226
0 references
0 references
0.9218092
0 references
0.9197072
0 references
0.9134225
0 references
0.9084288
0 references
0.90796465
0 references