Abstract

We show that separable convex functions enjoy ε-subdifferential sum formula as well as the Fenchel duality without a regularity assumption, and establish that for convex programs with separable convex constraints a new partially asymptotic Lagrange multiplier conditions hold without a constraint qualification. Examples are given to illustrate the results

Author information

Contact details are reproduced from the original publication and may be historical.

Guo Yin Li

Dept. of Applied Mathematics, University of New South Wales, Sydney 2052, Australia

g.li@unsw.edu.au

Vaithilingam Jeyakumar

Dept. of Applied Mathematics, University of New South Wales, Sydney 2052, Australia

v.jeyakumar@unsw.edu.au

Suggested citation

G. Y. Li, V. Jeyakumar. “Qualification-Free Optimality Conditions for Convex Programs with Separable Inequality Constraints.” Journal of Convex Analysis 16 (2009), No. 3&4, 845–856.

Copyright Banach Press 2009