One-dimensional P-algorithm with convergence rate O(n^-3+) for smooth functions
The authors describe an adaptive algorithm (one-dimensional P-algorithm with a decreasing sequence of threshold values \(\varepsilon_{n}\)) for approximating the global minimum of a smooth one-dimensional objective function \(f.\) The case where \(f\) is not unimodal is investigated. The main result of the paper under review is an algorithm with a decreasing sequence of threshold values \(\varepsilon_{n} = O(n^{-1 + \delta})\) which has a convergence rate \(O(n^{-3+\delta})\) for a large class of smooth objective functions. It is a continuation of the authors' article [J. Optim. Theory Appl. 104, 479-495 (1999; Zbl 0985.90075)], and the Chapter 6 the book by \textit{A. Torn} and \textit{A. Žilinskas}, [Global Optimization. Springer, Berlin (1989; Zbl 0752.90075)]. The organization of the paper under review is as follows: 1. Introduction. 2. P-algorithm. 3. Asymptotic normalized error bounds. 4. Numerical experiments.
- scientific article; zbMATH DE number 1560334
- An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions
- Achieving the ergodically optimal convergence rate for a one-dimensional minimization problem
- A one-dimensional optimization algorithm and its convergence rate under the Wiener measure
- On convergence of a \(P\)-algorithm based on a statistical model of continuously differentiable functions
- On convergence rate of a rectangular partition based global optimization algorithm
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- Achieving the ergodically optimal convergence rate for a one-dimensional minimization problem
- An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions
- Safe global optimization of expensive noisy black-box functions in the -Lipschitz framework
- Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives
- Bi-objective decision making in global optimization based on statistical models
- A system for distance studies and applications of metaheuristics
- On a global optimization algorithm for bivariate smooth functions
- A statistical model-based algorithm for `black-box' multi-objective optimisation
- On convergence of a \(P\)-algorithm based on a statistical model of continuously differentiable functions
- P-algorithm based on a simplicial statistical model of multimodal functions
- A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- A deterministic global optimization using smooth diagonal auxiliary functions
This page was built for publication: One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1594873)
