NLPOpt-Net: A Learning Method for Nonlinear Optimization with Feasibility Guarantees
Bimol Nath Roy, Rahul Golder, MM Faruque Hasan

TL;DR
NLPOpt-Net is an unsupervised neural network architecture designed to solve constrained nonlinear programs with guaranteed feasibility and near-optimal solutions, scalable to large problems.
Contribution
It introduces a novel projection-based learning architecture with a modified Chambolle-Pock algorithm and implicit differentiation, ensuring feasibility and optimality in nonlinear optimization.
Findings
Achieves near-zero constraint violations and optimality gaps.
Effectively predicts active sets and dual variables.
Provides significant inference speed improvements with C implementation.
Abstract
Nonlinear Parametric Optimization Network (NLPOpt-Net) is an unsupervised learning architecture to solve constrained nonlinear programs (NLP). Given the structure of an NLP, it learns the parametric solution maps with guaranteed constraint satisfaction. The architecture consists of a backbone neural network (NN) followed by a multilayer (-layered) projection. While the NN drives toward optimality through a loss function consisting of a modified Lagrangian augmented with a consistency loss, the projection ensures feasibility by projecting the NN predictions in the original constraint manifold. Instead of typical distance minimization, our projection exploits local quadratic approximations of the original NLP. Under certain conditions (such as convexity), the projection has a descent property, which improves the NN predictions further. NLPOpt-Net deploys an inversion-free, modified…
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.
