
Journal of Convex Analysis 12 (2005), No. 2, 279290 Copyright Heldermann Verlag 2005 A Dual Condition for the Convex Subdifferential Sum Formula with Applications R. S. Burachik Engenharia de Sistemas e Computacao, COPPE  UFRJ, CP 68511, Rio de Janeiro, CEP 21945970, Brazil regi@cos.ufrj.br V. Jeyakumar School of Mathematics, University of New South Wales, Sydney 2052, Australia jeya@maths.unsw.edu.au [Abstractpdf] \newcommand{\dom}{{\rm dom}\,} \newcommand{\epi}[1]{{\rm Epi}\,{\it #1}} In this paper we present a simple dual condition for the convex subdifferential sum formula. We show that if $f\ \mathrm{and}\ g:X\rightarrow \mathbb{R}\cup \{+\infty \}$ are proper lower semicontinuous convex functions then $\partial (f+g)(x)=\partial f(x)+\partial g(x),$ for each $x\in \dom{f}\cap \dom{g},$ whenever $\epi f^{\ast }+\epi g^{\ast }$ is weak$^{\ast }$ closed, where $\epi f^{\ast }$ denotes the epigraph of the conjugate function $f^{\ast }$ of $f.$ This dual closure condition, which is shown to be weaker than the well known primal interior point like conditions, is completely characterized by the subdifferential sum formula in the case where $f$ and $g$ are sublinear. It also provides a simple global condition for the strong conical hull intersection property (CHIP), which is a key regularity condition in the study of constrained interpolation and approximation problems. The subdifferential sum formula is then used to derive necessary and sufficient optimality conditions for a general coneconstrained convex optimization problem under a much weaker dual constraint qualification, and to obtain a generalized ClarkeEkeland dual least action principle. Keywords: Necessary and sufficient conditions, convex optimization, strong conical hull intersection property, ClarkeEkeland duality. MSC: 46N10; 90C25 [ Fulltextpdf (327 KB)] for subscribers only. 