2 papers
math.OC2026
A computational comparison of handling distance constraints in MINLP
Christopher Hojny, Leo Liberti
Minimum distance constraints (minDCs) appear in many geometric optimization problems. They pose major challenges for mixed-integer nonlinear programming (MINLP) due to their revers…
math.OC2024
Cutting planes for signomial programming
Liding Xu, Claudia D'Ambrosio, Leo Liberti +1
Cutting planes are of crucial importance when solving nonconvex nonlinear programs to global optimality, for example using the spatial branch-and-bound algorithms. In this paper, w…