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: | D. H. Fang |
---|---|
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!
|
Similar Items
-
Strong and Total Lagrange Dualities for Quasiconvex Programming
by: Donghui Fang, et al.
Published: (2014-01-01) -
Lagrangian Duality for Multiobjective Programming Problems in Lexicographic Order
by: X. F. Hu, et al.
Published: (2013-01-01) -
The duality of knowledge
by: Paul Hildreth, et al.
Published: (2002-01-01) -
A method of summability of Lagrange interpolation
by: Detlef H. Mache
Published: (1994-01-01) -
Duality of (h,φ)-Multiobjective Programming Involving Generalized Invex Functions
by: GuoLin Yu
Published: (2012-01-01)