Optimization with Dynamic Constraint Learning (DCL)
Not on the map. Why?
Abstract (arXiv)
We propose Dynamic Constraint Learning (DCL), a data-driven framework for constrained optimization when constraint functions are unknown and cannot be queried during optimization. At each iteration, the method learns a local surrogate from nearby data and solves a subproblem within a data-supported trust region. Compared with offline global constraint learning, the approach uses local surrogates that adapt to the data distribution during optimization and can achieve solution quality comparable to that of global models while using simpler local models and smaller optimization subproblems. We demonstrate the performance of DCL on a synthetic test problem and two case studies from the literature.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 17 references that are in the map. First posted on arXiv 28 Jul 2026.
Builds on
9 of 17 references.
References · 9
- 2021End-to-End Constrained Optimization Learning: A Surveycited by 157
- 2022OMLT: Optimization & Machine Learning Toolkitcited by 35
- 2022PyEPO: A PyTorch-based End-to-End Predict-then-Optimize Library for Linear and Integer Programmingcited by 32
- 2021Mixed-Integer Optimization with Constraint Learningcited by 31
- 2021Optimization with Constraint Learning: A Framework and Surveycited by 28
- 2019JANOS: An Integrated Predictive and Prescriptive Modeling Frameworkcited by 27
- 2021Modeling Design and Control Problems Involving Neural Network Surrogatescited by 9
- 2022On data-driven chance constraint learning for mixed-integer optimization problemscited by 3
- 2021Learning with Subset Stackingcited by 1
Built on by
Not cited yet.