A new exclusion test for finding the global minimum
作者:
Highlights:
•
摘要
Exclusion algorithms have been used recently to find all solutions of a system of nonlinear equations or to find the global minimum of a function over a compact domain. These algorithms are based on a minimization condition that can be applied to each cell in the domain. In this paper, we consider Lipschitz functions of order α and give a new minimization condition for the exclusion algorithm. Furthermore, convergence and complexity results are presented for such algorithm.
论文关键词:65K10,65Y20,Minimization condition,Lipschitz condition function,Lipschitz function of order α,Computational complexity
论文评审过程:Received 17 April 2005, Revised 12 January 2006, Available online 17 August 2006.
论文官网地址:https://doi.org/10.1016/j.cam.2006.01.028