Jacobian nonsingularity in nonlinear symmetric conic programming problems and its application (Q2217857)

Summary: This paper considers the nonlinear symmetric conic programming (NSCP) problems. Firstly, a type of strong sufficient optimality condition for NSCP problems in terms of a linear-quadratic term is introduced. Then, a sufficient condition of the nonsingularity of Clarke's generalized Jacobian of the Karush-Kuhn-Tucker (KKT) system is demonstrated. At last, as an application, this property is used to obtain the local convergence properties of a sequential quadratic programming- (SQP-) type method.