A convex-like duality scheme for quasi-convex programs (Q3744776)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3979879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A convex-like duality scheme for quasi-convex programs |
scientific article; zbMATH DE number 3979879 |
Statements
A convex-like duality scheme for quasi-convex programs (English)
0 references
1985
0 references
quasiconvex functions
0 references
symmetric duality scheme
0 references
duality gap
0 references
weak and strong duality theorems
0 references
Lagrangian
0 references
0.8040587902069092
0 references
0.8021961450576782
0 references
0.7984430193901062
0 references
0.7919978499412537
0 references
For quasiconvex programs, this paper presents a duality framework which is very similar to Rockafellar's duality scheme for convex programs. The authors first show that all primal quasiconvex programs are associated with quasiconvex functions which are also homogeneous of degree zero. This enables them to introduce a symmetric duality scheme. In the convex case, it is well known that the absence of a duality gap is equivalent to the closedness of the perturbation function at 0. In the quasiconvex case, the authors introduce the concept of evenness, which plays the same role as closedness in the convex case. Under certain conditions, the authors show that the dual of the dual is the primal. They also provide weak and strong duality theorems and discuss the relationship between the saddle points of the Lagrangian and the optimal solutions of the primal and dual programs.
0 references