A proximal-linearized NEP method for composite optimization with conic and manifold constraints
This paper studies difference-of-convex (DC) composite optimization problems with conic and manifold constraints. By penalizing the conic constraint with a distance-based penalty, we propose an inexact proximal-linearized nonsmooth exact penalty (iPLNEP) algorithm. The proposed method successively finds approximate min...