A closedness condition and its applications to DC programs with convex constraints ∗

@inproceedings{Dinh2008ACC,
  title={A closedness condition and its applications to DC programs with convex constraints ∗},
  author={Nguyen Dinh and T. T. A. Nghia and Guy Vallet},
  year={2008}
}
This paper concerns a closedness condition called (CC), requiring a convex function and a convex constrained system. This type of condition has played an important role in the study of convex optimization problems. Our aim is to establish several characterizations of this condition and to apply them to study minimizing problems involving a DC function under a cone-convex constraint and a set constraint. First, we establish several so-called " Toland-Fenchel-Lagrange " duality theorems. As… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 26 references

From linear to convex systems : consistency , Farkas ’ lemma and applications

N. Dinh, A. GobernaM., A. LópezM.
J . Convex Anal . • 2006

Dual condition for the convex subdifferential sum formula with applications

S. BurachikR., V. Jeyakumar
J . Convex Anal . • 2005

Frakas - type results with conjugate functions

I. BotR., G. Wanka
SIAM J . Optim . • 2005

Sequential Lagrangian conditions for convex programs with applications to semi - definite programming

N. Dinh, V. Jeyakumar, M. LeeG.
J . Optimization Theory Appl . • 2005

Similar Papers

Loading similar papers…