A deterministic method for continuous global optimization using a dense curve
From MaRDI portal
Publication:1998159
DOI10.1016/j.matcom.2020.05.029OpenAlexW3033795516MaRDI QIDQ1998159
Raouf Ziadi, Abdelatif Bencherif-Madani, Rachid Ellaia
Publication date: 6 March 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.2020.05.029
global optimizationEvtushenko's algorithmgeneralized pattern search algorithmLissajous parametrized curvereducing transformation method
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global descent method for constrained continuous global optimization
- Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method
- Continuous global optimization through the generation of parametric curves
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Global optimization. Scientific and engineering case studies
- A univariate global search working with a set of Lipschitz constants for the first derivative
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- Global optimization by multilevel coordinate search
- A new version of the Price's algorithm for global optimization
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- Parallel two-phase methods for global optimization on GPU
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
- Polynomial approximation on Lissajous curves in the \(d\)-cube
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
- A new extension of Piyavskii's method to Hölder functions of several variables
- A new pruning test for finding all global minimizers of nonsmooth functions
- Introduction to Global Optimization Exploiting Space-Filling Curves
- On the Convergence of Pattern Search Algorithms
- Generation of α‐dense curves and application to global optimization
- Pattern Search Methods for Linearly Constrained Minimization
- Pattern Search Algorithms for Bound Constrained Minimization
- A multidimensional descent method for global optimization
- On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
- Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
- Global optimization: the Alienor mixed method with Piyavskii‐Shubert technique
- A new reducing transformation for global optimization (with Alienor method)
- Global optimization: A new variant of the Alienor method
- Benchmarking optimization software with performance profiles.
