Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives
Daniela Lera, Yaroslav D. Sergeyev

TL;DR
This paper introduces and analyzes six new algorithms for one-dimensional global optimization problems involving Lipschitz functions and their derivatives, incorporating adaptive estimation and local improvement techniques to enhance search efficiency.
Contribution
The paper presents a unified framework for six algorithms that accelerate univariate Lipschitz optimization using adaptive estimation and local improvement methods.
Findings
Algorithms demonstrate promising performance on benchmark problems.
Adaptive techniques improve convergence speed.
Local improvement accelerates the search process.
Abstract
This paper deals with two kinds of the one-dimensional global optimization problems over a closed finite interval: (i) the objective function satisfies the Lipschitz condition with a constant ; (ii) the first derivative of satisfies the Lipschitz condition with a constant . 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), piece-wise linear functions are constructed and in the case (ii) smooth piece-wise quadratic functions are used. The constants and 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
