Strong and total Lagrange dualities for quasiconvex programming (Q2336429)
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: Strong and total Lagrange dualities for quasiconvex programming |
scientific article; zbMATH DE number 7131604
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong and total Lagrange dualities for quasiconvex programming |
scientific article; zbMATH DE number 7131604 |
Statements
Strong and total Lagrange dualities for quasiconvex programming (English)
0 references
19 November 2019
0 references
Summary: We consider the strong and total Lagrange dualities for infinite quasiconvex optimization problems. By using the epigraphs of the \(z\)-quasi-conjugates and the Greenberg-Pierskalla subdifferential of these functions, we introduce some new constraint qualifications. Under the new constraint qualifications, we provide some necessary and sufficient conditions for infinite quasiconvex optimization problems to have the strong and total Lagrange dualities.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.871303915977478
0 references
0.8518704771995544
0 references
0.8461017608642578
0 references
0.8449195027351379
0 references
0.8414217233657837
0 references
