The continuous quadrant penalty formulation of logical constraints
Open Journal of Mathematical Optimization · 2023
DOI: 10.5802/ojmo.28 ↗Kurz gefasst
Fachartikel in der Zeitschrift Open Journal of Mathematical Optimization, 2023. Verfasst von Sonia Cafieri und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 17 Literaturangaben.
Abstract (Originalsprache)
Could continuous optimization address efficiently logical constraints? We propose a continuous-optimization alternative to the usual discrete-optimization (big-M and complementary) formulations of logical constraints, that can lead to effective practical methods. Based on the simple idea of guiding the search of a continuous-optimization descent method towards the parts of the domain where the logical constraint is satisfied, we introduce a smooth penalty-function formulation of logical constraints, and related theoretical results. This formulation allows a direct use of state-of-the-art continuous optimization solvers. The effectiveness of the continuous quadrant penalty formulation is demonstrated on an aircraft conflict avoidance application.
Zitieren
APA
Cafieri, S., Conn, A. R., & Mongeau, M. (2023). The continuous quadrant penalty formulation of logical constraints. Open Journal of Mathematical Optimization. https://doi.org/10.5802/ojmo.28
Vancouver
Cafieri S, Conn AR, Mongeau M. The continuous quadrant penalty formulation of logical constraints. Open Journal of Mathematical Optimization. 2023. doi:10.5802/ojmo.28
BibTeX
@article{Cafieri2023,
author = {Cafieri, Sonia and Conn, Andrew R. and Mongeau, Marcel},
title = {The continuous quadrant penalty formulation of logical constraints},
journal = {Open Journal of Mathematical Optimization},
year = {2023},
doi = {10.5802/ojmo.28}
}
EUVIMED