<p>We propose and analyze asymptotic proximal point (APP) methods to find a global minimizer under a mild assumption. 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 results show that this method enjoys global linear convergence with high probability for all functions satisfying the assumption. Numerical experiments and comparisons in various dimensions from 2 to 500 demonstrate the benefits of the method.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Asymptotic Proximal Point Methods for Global Optimization

  • Xiaopeng Luo,
  • Xin Xu,
  • Herschel Rabitz

摘要

We propose and analyze asymptotic proximal point (APP) methods to find a global minimizer under a mild assumption. 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 results show that this method enjoys global linear convergence with high probability for all functions satisfying the assumption. Numerical experiments and comparisons in various dimensions from 2 to 500 demonstrate the benefits of the method.