تقرير
A Penalty-Based Guardrail Algorithm for Non-Decreasing Optimization with Inequality Constraints
| العنوان: | A Penalty-Based Guardrail Algorithm for Non-Decreasing Optimization with Inequality Constraints |
|---|---|
| المؤلفون: | Stepanovic, Ksenija, Böhmer, Wendelin, de Weerdt, Mathijs |
| سنة النشر: | 2024 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Mathematics - Optimization and Control, Computer Science - Artificial Intelligence |
| الوصف: | Traditional mathematical programming solvers require long computational times to solve constrained minimization problems of complex and large-scale physical systems. Therefore, these problems are often transformed into unconstrained ones, and solved with computationally efficient optimization approaches based on first-order information, such as the gradient descent method. However, for unconstrained problems, balancing the minimization of the objective function with the reduction of constraint violations is challenging. We consider the class of time-dependent minimization problems with increasing (possibly) nonlinear and non-convex objective function and non-decreasing (possibly) nonlinear and non-convex inequality constraints. To efficiently solve them, we propose a penalty-based guardrail algorithm (PGA). This algorithm adapts a standard penalty-based method by dynamically updating the right-hand side of the constraints with a guardrail variable which adds a margin to prevent violations. We evaluate PGA on two novel application domains: a simplified model of a district heating system and an optimization model derived from learned deep neural networks. Our method significantly outperforms mathematical programming solvers and the standard penalty-based method, and achieves better performance and faster convergence than a state-of-the-art algorithm (IPDD) within a specified time limit. |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2405.01984 |
| رقم الأكسشن: | edsarx.2405.01984 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |