Journal of convex analysis, Tome 13 (2006) no. 3, pp. 773-784
Citer cet article
V. Jeyakumar; Z. Y. Wu. A Qualification Free Sequential Pshenichnyi-Rockafellar Lemma and Convex Semidefinite Programming. Journal of convex analysis, Tome 13 (2006) no. 3, pp. 773-784. http://geodesic.mathdoc.fr/item/JCA_2006_13_3_JCA_2006_13_3_a18/
@article{JCA_2006_13_3_JCA_2006_13_3_a18,
author = {V. Jeyakumar and Z. Y. Wu},
title = {A {Qualification} {Free} {Sequential} {Pshenichnyi-Rockafellar} {Lemma} and {Convex} {Semidefinite} {Programming}},
journal = {Journal of convex analysis},
pages = {773--784},
year = {2006},
volume = {13},
number = {3},
url = {http://geodesic.mathdoc.fr/item/JCA_2006_13_3_JCA_2006_13_3_a18/}
}
TY - JOUR
AU - V. Jeyakumar
AU - Z. Y. Wu
TI - A Qualification Free Sequential Pshenichnyi-Rockafellar Lemma and Convex Semidefinite Programming
JO - Journal of convex analysis
PY - 2006
SP - 773
EP - 784
VL - 13
IS - 3
UR - http://geodesic.mathdoc.fr/item/JCA_2006_13_3_JCA_2006_13_3_a18/
ID - JCA_2006_13_3_JCA_2006_13_3_a18
ER -
%0 Journal Article
%A V. Jeyakumar
%A Z. Y. Wu
%T A Qualification Free Sequential Pshenichnyi-Rockafellar Lemma and Convex Semidefinite Programming
%J Journal of convex analysis
%D 2006
%P 773-784
%V 13
%N 3
%U http://geodesic.mathdoc.fr/item/JCA_2006_13_3_JCA_2006_13_3_a18/
%F JCA_2006_13_3_JCA_2006_13_3_a18
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.
