Efficient Dynamic and Momentum Aperture Optimization for Lattice Design Using Multipoint Bayesian Algorithm Execution

University of Southern California, Los Angeles, CA 90089 (Dated: November 25, 2025) We demonstrate that multipoint Bayesian algorithm execution can overcome fundamental computational challenges in storage ring design optimization. Dynamic (DA) and momentum (MA) optimization is a multipoint, multiobjective design task for storage rings, ultimately informing the flux of x-ray sources and luminosity of colliders. We remove this bottleneck using multipointBAX, which selects, simulates, and models each trial configuration at the single particle level. We demonstrate our approach on a novel design for a fourth-generation light source, with neural-network powered multipointBAX achieving equivalent Pareto front results using more than two orders of magnitude fewer tracking computations compared to genetic algorithms. The significant reduction in cost positions multipointBAX as a promising alternative to black-box optimization, and we anticipate multipointBAX will be instrumental in the design of future light sources, colliders, and large-scale scientific facilities. Designing modern scientific facilities -- from synchrotron light sources to particle colliders -- requires optimizing hundreds of parameters in a complex, nonlinear systems, where a single design evaluation can take hours of computation. In storage rings, this challenge is exemplified by dynamic aperture (DA) and momentum aperture (MA) optimization, where maximizing the regions of particle stability directly determines injection efficiency, beam lifetime, and ultimately the photon flux or luminosity achievable in next-generation facilities. The computational bottleneck is severe: maximizing DA and MA is a type of multipoint optimization, where evaluating a single lattice design requires tracking tens of thousands of particles for hundreds of thousands of turns, making global optimization prohibitively expensive. Moreover, there is a trade-off between maximizing DA and MA area, so the standard approach is to find a Pareto front; i.e.