Stable Zero Lagrange Duality for DC Conic Programming
Keyword(s):
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.
2015 ◽
Vol 22
(4)
◽
pp. 550-552
◽
1966 ◽
Vol 17
(1)
◽
pp. 148-148
◽
1985 ◽
Vol 8
(2)
◽
pp. 276-288
◽
Keyword(s):
2002 ◽
Vol 121
(1-2)
◽
pp. 75-89
◽