The paper is devoted to the study of a new class of conic constrained optimization problems with objectives given as differences of a composite function and a convex function. We first introduce some new notions of constraint qualifications in terms of the epigraphs of the conjugates of these functions. Under the new constraint qualifications, we provide necessary and sufficient conditions for several versions of Farkas lemmas to hold. Similarly, we provide characterizations for conic constrained optimization problems to have the strong or stable strong dualities such as Lagrange, Fenchel–Lagrange or Toland–Fenchel–Lagrange duality.
Journal of Optimization Theory and Applications – Springer Journals
Published: Jan 16, 2018
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.
All for just $49/month
It’s easy to organize your research with our built-in tools.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud