Stable zero Lagrange duality for DC conic programming (Q1952895)
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: Stable zero Lagrange duality for DC conic programming |
scientific article; zbMATH DE number 6169944
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stable zero Lagrange duality for DC conic programming |
scientific article; zbMATH DE number 6169944 |
Statements
Stable zero Lagrange duality for DC conic programming (English)
0 references
3 June 2013
0 references
Summary: We consider the problems of minimizing a DC function under a cone-convex constraint and a set constraint. By using the infimal convolution of the conjugate functions, we present a new constraint qualification which completely characterizes the Farkas-type lemma and the stable zero Lagrange duality gap property for DC conical programming problems in locally convex spaces.
0 references
constraint qualification
0 references
Farkas-type lemma
0 references
Lagrange duality gap
0 references
0 references
0 references
0 references
0 references
0 references
0 references
