Digital Annealing Engine for High-speed Solving of Constrained Binary Quadratic Problems on Multiple GPUs

This paper presents a digital annealing engine capable of high-speed solving the Binary Quadratic Programming Problem (BQP) with equality and inequality constraints. While many Quadratic Unconstrained Binary Optimization (QUBO) solvers have been developed for combinatorial optimization problems, the...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of IEEE International Symposium on Consumer Electronics s. 1 - 6
Hlavní autori: Katayama, Kentaro, Yoneoka, Noboru, Kanda, Kouichi, Tamura, Hirotaka, Nakayama, Hiroshi, Watanabe, Yasuhiro
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 06.01.2024
Predmet:
Annealing
Benchmark testing
Binary Quadratic Programming Problem
Combinatorial Optimization
Engines
inequality constraint
Markov Chain Monte Carlo
Monte Carlo methods
one-hot constraint
Optimization
Quadratic programming
Quadratic Unconstrained Binary Optimization
Search problems
ISSN:2158-4001
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper presents a digital annealing engine capable of high-speed solving the Binary Quadratic Programming Problem (BQP) with equality and inequality constraints. While many Quadratic Unconstrained Binary Optimization (QUBO) solvers have been developed for combinatorial optimization problems, they are specialized for "unconstrained" BQP and struggle to solve "constrained" BQP at high speed. To address this issue, we developed a digital annealing engine on GPUs that leverages constraints to narrow the search space and directly evaluates inequality violations during Markov Chain Monte Carlo based searches. We evaluated the performance of the Digital Annealer (DA) system with the developed engine on benchmark problems with one-hot (a type of equality constraint) and inequality constraints. The results showed that the developed DA system achieved superior solving performance compared to the previous generation of DA. It also showed comparable performance to state-of-the-art dedicated solvers. Our results suggest that this digital annealing engine is a promising solution for high-speed solving constrained BQP.
ISSN:2158-4001
DOI:10.1109/ICCE59016.2024.10444391