An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions
From MaRDI portal
Publication:1935284
DOI10.1007/s10957-012-0060-3zbMath1257.90078OpenAlexW2052426839MaRDI QIDQ1935284
Yvonne Chen, James M. Calvin, Antanas Žilinskas
Publication date: 14 February 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0060-3
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework ⋮ Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics ⋮ Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives ⋮ On a global optimization algorithm for bivariate smooth functions ⋮ Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms ⋮ On convergence rate of a rectangular partition based global optimization algorithm ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization ⋮ On efficiency of a single variable bi-objective optimization algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
- Bayesian algorithms for one-dimensional global optimization
- Average-case analysis of numerical problems
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions
- Global minimization algorithms for Hölder functions
- An information global minimization algorithm using the local improvement technique
- Convergence rates of efficient global optimization algorithms
- Introduction to global optimization.
This page was built for publication: An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions