Constraint Boundary Wandering Framework: Enhancing Constrained Optimization With Deep Neural Networks.

Journal: IEEE transactions on pattern analysis and machine intelligence
Published Date:

Abstract

Constrained optimization problems are pervasive in various fields, and while conventional techniques offer solutions, they often struggle with scalability. Leveraging the power of deep neural networks (DNNs) in optimization, we present a novel learning-based approach, the Constraint Boundary Wandering Framework (CBWF), to address these challenges. Our contributions include introducing a boundary wandering strategy inspired by the active-set method, enhancing equality constraint feasibility, and treating the Lipschitz constant as a learnable parameter. Additionally, we evaluate the regularization term, illustrating that the nonsmooth L2 norm yields superior results. Extensive testing on synthetic datasets and the ACOPT dataset demonstrates CBWF's superiority, outperforming existing deep learning-based solvers in terms of both objective and constraint loss.

Authors

  • Shuang Wu
  • Shixiang Chen
    School of Political Science and Public Administration, Wuhan University, Wuhan, Hubei, China.
  • Li Shen
    Department of Clinical Pharmacy, Children's Hospital of Fudan University, National Children's Medical Center, Shanghai, China.
  • Lefei Zhang
  • Dacheng Tao

Keywords

No keywords available for this article.