Continuous global optimization through the generation of parametric curves
From MaRDI portal
Publication:671196
DOI10.1016/j.amc.2016.01.067zbMath1410.90172OpenAlexW2285243582MaRDI QIDQ671196
Abdelatif Bencherif-Madani, Rachid Ellaia, Raouf Ziadi
Publication date: 20 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2016.01.067
global optimizationreducing transformationEvtushenko's algorithmgeneralized pattern search methodparametrized curvestochastic local optimization
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Stochastic programming (90C15)
Related Items
A new trisection method for solving Lipschitz bi-objective optimization problems, Continuous global optimization on fractals through \(\alpha\)-dense curves, Approximating the attractor set of iterated function systems of order \(m\) by \(\alpha\)-dense curves, Unnamed Item, Approximating the Hausdorff distance by \(\alpha\)-dense curves, Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method, A deterministic method for continuous global optimization using a dense curve, Approximating multiple integrals of continuous functions by \(\delta \)-uniform curves, Approximating roots of nonlinear systems by \(\alpha\)-dense curves
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Cellular particle swarm optimization
- Reducing transformation and global optimization
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- A filled function method applied to nonsmooth constrained global optimization
- New filled functions for nonsmooth global optimization
- Extension of Piyavskii's algorithm to continuous global optimization
- Global optimization by multilevel coordinate search
- Lipschitzian optimization without the Lipschitz constant
- Handbook of global optimization
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Global optimization: Fractal approach and non-redundant parallelism
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Stochastic global optimization.
- 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
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Introduction to Global Optimization Exploiting Space-Filling Curves
- A CARTOPT METHOD FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION
- `` Direct Search Solution of Numerical and Statistical Problems
- Testing Unconstrained Optimization Software
- Analysis of Generalized Pattern Searches
- Generation of α‐dense curves and application to global optimization
- Pattern Search Algorithms for Bound Constrained Minimization
- A multidimensional descent method for global optimization
- Space filling curves and mathematical programming
- Handbook of metaheuristics
- Acceleration tools for diagonal information global optimization
- Global optimization: A new variant of the Alienor method
- A locally-biased form of the DIRECT algorithm.
