Optimality conditions for nonsmooth semidefinite programming via convexificators

Abstract

This study is devoted to the semidefinite optimization problems with inequality constraints. We use the notion of convexificators to establish optimality conditions for nonsmooth semidefinite optimization problems. Moreover, we introduce appropriate constraint qualifications to present the Karush–Kuhn–Tucker multipliers. © 2014, Springer Basel.