Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives

This paper deals with two kinds of the one-dimensional global optimization problem over a closed finite interval: (i) the objective function $f(x)$ satisfies the Lipschitz condition with a constant $L$; (ii) the first derivative of $f(x)$ satisfies the Lipschitz condition with a constant $M$. In the paper, six algorithms are presented for the case (i) and six algorithms for the case (ii). In both cases, auxiliary functions are constructed and adaptively improved during the search. In the case (i), piecewise linear functions are constructed and in the case (ii) smooth piecewise quadratic functions are used. The constants $L$ and $M$ either are taken as values known a priori or are dynamically estimated during the search. A recent technique that adaptively estimates the local Lipschitz constants over different zones of the search region is used to accelerate the search. A new technique called the local improvement is introduced in order to accelerate the search in both cases (i) and (ii). The algorithms are...

[1]  Regina Hunter Mladineo.  Convergence rates of a global optimization algorithm , 1992, Math. Program..

[2]  Isaac Siwale.  ON GLOBAL OPTIMIZATION , 2015 .

[3]  Yaroslav D. Sergeyev,et al.  A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints , 2007, Optim. Lett..

[4]  Y. D. Sergeyev,et al.  Global Optimization with Non-Convex Constraints - Sequential and Parallel Algorithms (Nonconvex Optimization and its Applications Volume 45) (Nonconvex Optimization and Its Applications) , 2000 .

[5]  A. Zilinskas,et al.  Algorithm AS 133: Optimization of One-Dimensional Multimodal Functions , 1978 .

[6]  R E.,et al.  Global Optimization Using Interval Analysis : The One-Dimensional Case , 2004 .

[7]  Yaroslav D. Sergeyev,et al.  Univariate Global Optimization with Multiextremal Non-Differentiable Constraints Without Penalty Functions , 2006, Comput. Optim. Appl..

[8]  Y. Sergeyev.  A one-dimensional deterministic global minimization algorithm , 1995 .

[9]  Devendra Kalra,et al.  Guaranteed ray intersections with implicit surfaces , 1989, SIGGRAPH.

[10]  Yaroslav D. Sergeyev,et al.  An algorithm for solving global optimization problems with nonlinear constraints , 1995, J. Glob. Optim..

[11]  János D. Pintér,et al.  Global Optimization: Software, Test Problems, and Applications , 2002 .

[12]  J D Pinter,et al.  Global Optimization in Action—Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications , 2010 .

[13]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[14]  Yaroslav D. Sergeyev,et al.  Global one-dimensional optimization using smooth auxiliary functions , 1998, Math. Program..

[15]  A. ilinskas,et al.  One-Dimensional global optimization for observations with noise , 2005 .

[16]  E. Hansen.  Global optimization using interval analysis — the multi-dimensional case , 1980 .

[17]  K. Hamacher.  On stochastic global optimization of one-dimensional functions , 2005 .

[18]  Yaroslav D. Sergeyev,et al.  Finding the Minimal Root of an Equation with the Multiextremal and Nondifferentiable Left-Hand Part , 2001, Numerical Algorithms.

[19]  Leo Breiman,et al.  A deterministic algorithm for global optimization , 1993, Math. Program..

[20]  James M. Calvin.  An Adaptive Univariate Global Optimization Algorithm and Its Convergence Rate under the Wiener Measure , 2011, Informatica.

[21]  Pasquale Daponte,et al.  Two methods for solving optimization problems arising in electronic measurements and electrical engineering , 1999, SIAM J. Optim..

[22]  Lonnie Hamm,et al.  GLOBAL OPTIMIZATION METHODS , 2002 .

[23]  P. Pardalos,et al.  Handbook of global optimization , 1995 .

[24]  Michael A. Wolfe.  On first zero crossing points , 2004, Appl. Math. Comput..

[25]  E.C. Jones,et al.  Introduction to filter theory , 1978, Proceedings of the IEEE.

[26]  Yaroslav D. Sergeyev,et al.  A univariate global search working with a set of Lipschitz constants for the first derivative , 2009, Optim. Lett..

[27]  Panos M. Pardalos,et al.  State of the Art in Global Optimization , 1996 .

[28]  Pasquale Daponte,et al.  An algorithm for finding the zero crossing of time signals with Lipschitzean derivatives , 1995 .

[29]  K. Mondal,et al.  Analog and digital filters: Design and realization , 1980, Proceedings of the IEEE.

[30]  Pasquale Daponte,et al.  Fast detection of the first zero-crossing in a measurement signal set , 1996 .

[31]  S. A. Piyavskii.  An algorithm for finding the absolute extremum of a function , 1972 .

[32]  Yaroslav D. Sergeyev,et al.  Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints , 2001, J. Glob. Optim..

[33]  Marco Locatelli,et al.  Bayesian Algorithms for One-Dimensional Global Optimization , 1997, J. Glob. Optim..