Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
From MaRDI portal
Publication:2229118
DOI10.1016/J.MATCOM.2016.05.006OpenAlexW2429860054MaRDI QIDQ2229118
Yaroslav D. Sergeyev, Dmitri E. Kvasov, Marat S. Mukhametzhanov
Publication date: 19 February 2021
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2016.05.006
Related Items (18)
Integrating \(\varepsilon \)-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems ⋮ Best practices for comparing optimization algorithms ⋮ Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework ⋮ Geodesic and contour optimization using conformal mapping ⋮ Metaheuristic vs. deterministic global optimization algorithms: the univariate case ⋮ Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives ⋮ Mean-based Borda count for paradox-free comparisons of optimization algorithms ⋮ On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales ⋮ Multidimensional Global Search Using Numerical Estimations of Minimized Function Derivatives and Adaptive Nested Optimization Scheme ⋮ Controller tuning approach with robustness, stability and dynamic criteria for the original AVR system ⋮ Team arrangement heuristic algorithm (TAHA): theory and application ⋮ Performance analysis of stand-alone six-phase induction generator using heuristic algorithms ⋮ A deterministic method for continuous global optimization using a dense curve ⋮ Methods to compare expensive stochastic optimization algorithms with random restarts ⋮ On the search of the shape parameter in radial basis functions using univariate global optimization methods ⋮ Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers ⋮ DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization ⋮ Multidimensional global optimization using numerical estimates of objective function derivatives
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lipschitz global optimization methods in control problems
- Differential evolution. A practical approach to global optimization. With CD-ROM.
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- One-dimensional global optimization for observations with noise
- A deterministic global optimization using smooth diagonal auxiliary functions
- A parallel method for finding the global minimum of univariate functions
- Handbook of global optimization
- Parallel characteristical algorithms for solving problems of global optimization
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions
- On similarities between two models of global optimization: Statistical models and radial basis functions
- Globally-biased disimpl algorithm for expensive global optimization
- Optimization challenges in the structured low rank approximation problem
- A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
- Stochastic global optimization.
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Simplicial Global Optimization
- Encyclopedia of Optimization
- Firefly Algorithms for Multimodal Optimization
- Algorithm AS 133: Optimization of One-Dimensional Multimodal Functions
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
- Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions
- Benchmarking Derivative-Free Optimization Algorithms
- Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
- Algorithm 829
- A Sequential Method Seeking the Global Maximum of a Function
- Benchmarking optimization software with performance profiles.
- Finding the minimal root of an equation with the multiextremal and nondifferentiable left-hand part
This page was built for publication: Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
