On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
Open Access
- 1 July 2025
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- p. 1-23
Abstract
The aim of this paper is to solve linear semidefinite programs arising from higher-order Lasserre relaxations of unconstrained binary quadratic optimization problems. For this we use an interior point method with a preconditioned conjugate gradient method solving the linear systems. The preconditioner utilizes the low-rank structure of the solution of the relaxations. In order to fully exploit this, we need to re-write the moment relaxations. To treat the arising linear equality constraints we use an $$\ell _1$$ -penalty approach within the interior-point solver. The efficiency of this approach is demonstrated by numerical experiments with the MAXCUT and other randomly generated problems and a comparison with a state-of-the-art semidefinite solver and the ADMM method. We further propose a hybrid ADMM-interior-point method that proves to be efficient for certain problem classes. As a by-product, we observe that the second-order relaxation is often high enough to deliver a globally optimal solution of the original problem.
Keywords
All Related Versions
Funding Information
- Czech Technical University in Prague
This publication has 27 references indexed in Scilit:
- Partial Lasserre relaxation for sparse Max-CutOptimization and Engineering, 2022
- EXPEDIS: An exact penalty method over discrete setsDiscrete Optimization, 2022
- Binary quadratic optimization problems that are difficult to solve by conic relaxationsDiscrete Optimization, 2017
- Sparse sums of squares on finite abelian groups and improved semidefinite liftsMathematical Programming, 2016
- A dynamic inequality generation scheme for polynomial programmingMathematical Programming, 2015
- The unconstrained binary quadratic programming problem: a surveyJournal of Combinatorial Optimization, 2014
- Alternating direction augmented Lagrangian methods for semidefinite programmingMathematical Programming Computation, 2010
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations2007
- An independent benchmarking of SDP and SOCP solversMathematical Programming, 2003
- Numerische Verfahren zur Lösung unrestringierter Optimierungsaufgaben1999