Full text is hosted by Heldermann Verlag and may request subscriber credentials.
Abstract
Pshenichnyi-Rockafellar Lemma provides a necessary and sufficient condition for a minimizer of a lower semi-continuous convex function over a convex set whenever a qualification condition holds. In this paper we present sequential generalizations of the lemma without any qualification condition. As an application we derive qualification free optimality conditions for a more general convex semidefinite programming model problem
Author information
Contact details are reproduced from the original publication and may be historical.
VJ
Vaithilingam Jeyakumar
School of Mathematics, University of New South Wales, Sydney 2052, Australia
School of Mathematics, University of New South Wales, Sydney 2052, Australia Permanent Address: Dept. of Mathematics and Computer Science, Chongqing Normal University, Chongqing 400047, P. R. China
V. Jeyakumar, Z. Y. Wu. “A Qualification Free Sequential Pshenichnyi-Rockafellar Lemma and Convex Semidefinite Programming.” Journal of Convex Analysis 13 (2006), No. 3/4, 773–784.