Proximal Basin Hopping

Proximal basin hopping: global optimization with guarantees

arXiv:2605.18364v2 Announce Type: replace Abstract: Global optimization is a challenging problem, with plenty of algorithms displaying empirical success, but scarce theoretical backing. In this work, we propose a new theoretical framework called Proximal Basin Hopping (PBH), carefully tailored to combine proximal optimization and local minimization. We use it to construct a practical algorithm that converges to the global minimizer with high probability, when using a finite amount of samples.