3 papers
math.OC2026
Relaxations for binary polynomial optimization via signed certificates
Liding Xu, Leo Liberti
We consider the problem of minimizing a polynomial over the (binary) hypercube. We show that, for a specific set of polynomials, their binary non-negativity (i.e. on the hyperc…
cs.AI2026
Agentic MIP Research: Accelerated Constraint Handler Generation
Liding Xu, Yugeng Zhou, Sebastian Pokutta
Mixed-integer programming (MIP) research is both mathematically sophisticated and engineering-intensive: testing an algorithmic hypothesis within a branch-and-cut solver requires s…
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…