Strong KKT conditions and weak sharp solutions in convex-composite optimization

Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the classical KKT conditions. These notions are shown to be closely related to the notions of sharp or weak sharp solutions. As applications, we extend some results on metric regularity of inequalities from the convex case to the convex-composite case. Keywords Convex-composite optimization · Strong KKT condition · Sharp solution · Weak sharp solution Mathematics Subject Classification (2000) 90C31 · 90C25 · 49J52 · 46B20

• Type: Journal
• Year: 2011
• Where: MP
• Authors: Xi Yin Zheng, Kung Fu Ng
• Keywords: Computer Networks, Convex Case, Metric Regularity, MP 2011, Sharp Solutions