Optimality conditions for nonlinear second-order cone programming and symmetric cone programming

Nonlinear symmetric cone programming (NSCP) generalizes important optimization problems such as nonlinear programming, nonlinear semidefinite programming and nonlinear second-order cone programming (NSOCP). In this work, we present two new optimality conditions for NSCP without constraint qualifications, which implies the Karush-Kuhn-Tucker conditions under a condition weaker than Robinson's constraint qualification. In addition, we show the relationship of both optimality conditions in the context of NSOCP, where we also present an augmented Lagrangian method with better global convergence results.

Article

Download

View Optimality conditions for nonlinear second-order cone programming and symmetric cone programming