Asymptotic proximal point methods: finding the global minima with linear convergence for a class of multiple minima problems

arXiv2004.02210MaRDI QIDQ6338086

Xin Xu, Xiaopeng Luo, Herschel Rabitz

Publication date: 5 April 2020

Abstract: We propose and analyze asymptotic proximal point (APP) methods to find the global minimizer for a class of nonconvex, nonsmooth, or even discontinuous multiple minima functions. The method is based on an asymptotic representation of nonconvex proximal points so that it can find the global minimizer without being trapped in saddle points, local minima, or even discontinuities. Our main result shows that the method enjoys the global linear convergence for such a class of functions. Furthermore, the method is derivative-free and its per-iteration cost, i.e., the number of function evaluations, is also bounded, so it has a complexity bound $mathcalO(logfrac1epsilon)$ for finding a point such that the gap between this point and the global minimizer is less than $epsilon>0$. Numerical experiments and comparisons in various dimensions from $2$ to $500$ demonstrate the benefits of the method.

Has companion code repository: https://github.com/xiaopengluo/app

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

This page was built for publication: Asymptotic proximal point methods: finding the global minima with linear convergence for a class of multiple minima problems