Strong duality for generalized convex optimization problems (Q948630)
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 duality for generalized convex optimization problems |
scientific article; zbMATH DE number 5353250
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong duality for generalized convex optimization problems |
scientific article; zbMATH DE number 5353250 |
Statements
Strong duality for generalized convex optimization problems (English)
0 references
17 October 2008
0 references
Strong duality for nearly-convex optimization problems is established. Three kinds of conjugate dual problems are associated to the primal optimization problem: the Langrange dual, Fenchel dual, and Fenchel-Lagrange dual problems. The main result shows that, under suitable conditions (constraint qualifications), the optimal objective values of these four problems coincide.
0 references
