Automatic source code generation for deterministic global optimization with parallel architectures.
Saved in:
| Title: | Automatic source code generation for deterministic global optimization with parallel architectures. |
|---|---|
| Authors: | Gottlieb, Robert X.1 (AUTHOR), Xu, Pengfei1 (AUTHOR), Stuber, Matthew D.1 (AUTHOR) stuber@alum.mit.edu |
| Source: | Optimization Methods & Software. Apr2026, Vol. 41 Issue 2, p308-346. 39p. |
| Subjects: | Global optimization, Graphics processing units, Parallel processing, Code generators, Computer performance, Branch & bound algorithms, Software libraries (Computer programming) |
| Abstract: | Trends over the past two decades indicate that much of the performance gains of commercial optimization solvers is due to improvements in x86 hardware. To continue making progress, it is critical to consider alternative/specialized massively parallel computing architectures. In this work, we detail the development of an open-source source code transformation approach built using Symbolics.jl to construct McCormick-based relaxations of functions that enables their effective parallelized evaluation. We then apply this approach in a novel parallelized branch-and-bound routine that offloads lower- and upper-bounding problems to a GPU. The effectiveness of this new approach is demonstrated on three nonconvex problems of interest, where it yields convergence time improvements of 22–118x compared to an equivalent serial CPU implementation and in two cases outperforms vanilla branch-and-bound versions of existing state-of-the-art solvers that use tighter bounding techniques. This work exemplifies how deterministic global optimizers using alternative hardware architectures can compete with—or eventually outclass—even the most powerful serial CPU implementations, and to the best of the authors' knowledge, represents the first successful demonstration of deterministic global optimization using a GPU. [ABSTRACT FROM AUTHOR] |
| Copyright of Optimization Methods & Software is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
Be the first to leave a comment!
