Global solution of Quadratic Problems by Interval Methods and Convex Relaxations

• Published in: Journal of global optimization 2024
• Main Authors: Elloumi, Sourour, Lambert, Amélie, Neveu, Bertrand, Trombettoni, Gilles
• Format: Article
• Language: English
• Subjects: Combinatorics; Mathematics
• ISSN: 0925-5001; 1573-2916
• DOI: 10.1007/s10898-024-01370-8

Interval branch-and-bound solvers provide reliable algorithms for handling non-convex optimization problems by ensuring the feasibility and the optimality of the computed solutions, i.e. independently from the floating-point rounding errors. Moreover, these solvers deal with a wide variety of mathematical operators. However, these solvers are not dedicated to quadratic optimization and do not exploit nonlinear convex relaxations in their framework. We present an interval branch-andbound method that can efficiently solve quadratic optimization problems. At each node explored by the algorithm, our solver uses a quadratic convex relaxation which is as strong as a semi-definite programming relaxation, and a variable selection strategy dedicated to quadratic problems. The interval features can then propagate efficiently this information for contracting all variable domains. We also propose to make our algorithm rigorous by certifying firstly the convexity of the objective function of our relaxation, and secondly the validity of the lower bound calculated at each node. In the non-rigorous case, our experiments show significant speedups on general integer quadratic instances, and when reliability is required, our first results show that we are able to handle medium-sized instances in a reasonable running time.