OPTIMALITY CONDITIONS FOR A CLASS OF SEMIDEFINITE PROGRAMMING

Guorong Wu · Journal of Inner Mongolia Agricultural University · 2012

First,by introducing the vector-valued generalized convex functions,the relationships are investigated between the vector-valued invex functions and the vector-valued preinvex functions.Then,the generalized Fakars lemma for a class of locally Lipschitz invex functions is proved.Finally,based on this lemma,the optimality conditions for a class of semidefinite programming are established.

Read the paper · More papers on PaperTik