Stable Zero Lagrange Duality for DC Conic Programming
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 g...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2012/606457 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| 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. |
|---|---|
| ISSN: | 1110-757X 1687-0042 |