A proximal-linearized NEP method for composite optimization with conic and manifold constraints
iPLNEP is shown to achieve an $O(\epsilon^{-2})$ worst-case iteration complexity bound for finding an $\epsilon$-stationary point, and provides the first proximal-linearized NEP framework with provable oracle complexity guarantees for DC composite optimization with conic and manifold constraints.