Partial Envelope for Optimization Problem with Nonconvex Constraints
Xiaoyin Hu, Xin Liu, Kim-Chuan Toh, Nachuan Xiao

TL;DR
This paper introduces a novel forward-backward semi-envelope method for solving nonlinear constrained optimization problems with nonconvex constraints, enabling efficient optimization over the constraint set while preserving convergence properties.
Contribution
The paper proposes a new semi-envelope approach that simplifies constrained optimization by eliminating convex constraints and directly optimizing over the nonconvex constraint set, with proven theoretical properties.
Findings
The semi-envelope is well-defined and locally Lipschitz smooth near the constraint set.
The stationary points of the original problem and the semi-envelope coincide locally.
Numerical experiments show the method's practical efficiency.
Abstract
In this paper, we consider the nonlinear constrained optimization problem (NCP) with constraint set , where is a closed convex subset of . Building upon the forward-backward envelope framework for optimization over , we propose a forward-backward semi-envelope (FBSE) approach for solving (NCP). In the proposed semi-envelope approach, we eliminate the constraint through a specifically designed envelope scheme while preserving the constraint . We establish that the forward-backward semi-envelope for (NCP) is well-defined and locally Lipschitz smooth over a neighborhood of . Furthermore, we prove that (NCP) and its corresponding forward-backward semi-envelope have the same first-order stationary points within a neighborhood of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
