A deterministic method for continuous global optimization using a dense curve

DOI10.1016/J.MATCOM.2020.05.029OpenAlexW3033795516MaRDI QIDQ1998159FDOQ1998159

Rachid Ellaia, Raouf Ziadi, Abdelatif Bencherif-Madani

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

Recommendations

• Global optimization via α‐dense curves
• 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 continuously differentiable filled function method for global optimization
• Generation of α‐dense curves and application to global optimization
• Dynamic globally concavized filled function method for continuous global optimization
• Global descent method for constrained continuous global optimization
• scientific article; zbMATH DE number 611142
• Continuous global optimization on fractals through \(\alpha\)-dense curves
• α‐dense curves and global optimization

zbMATH Keywords

global optimizationEvtushenko's algorithmgeneralized pattern search algorithmLissajous parametrized curvereducing transformation method

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Operations research, mathematical programming (90-XX)

Cites Work

• Benchmarking optimization software with performance profiles.
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Pattern Search Algorithms for Bound Constrained Minimization
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• 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
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• A new pruning test for finding all global minimizers of nonsmooth functions
• On the Convergence of Pattern Search Algorithms
• Title not available (Why is that?)
• A new extension of Piyavskii's method to Hölder functions of several variables
• Global descent method for constrained continuous global optimization
• Pattern Search Methods for Linearly Constrained Minimization
• Global optimization by multilevel coordinate search
• Introduction to Global Optimization Exploiting Space-Filling Curves
• Global optimization. Scientific and engineering case studies
• Title not available (Why is that?)
• A new version of the Price's algorithm for global optimization
• A univariate global search working with a set of Lipschitz constants for the first derivative
• Generation of α‐dense curves and application to global optimization
• Global optimization: the Alienor mixed method with Piyavskii‐Shubert technique
• Global optimization: A new variant of the Alienor method
• A new reducing transformation for global optimization (with Alienor method)
• Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
• 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
• Title not available (Why is that?)
• A multidimensional descent method for global optimization
• GOSH: derivative-free global optimization using multi-dimensional space-filling curves
• Metaheuristic vs. deterministic global optimization algorithms: the univariate case
• Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
• On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
• Parallel two-phase methods for global optimization on GPU
• Polynomial approximation on Lissajous curves in the \(d\)-cube

Cited In (4)

• Global optimization via α‐dense curves
• Generation of α‐dense curves and application to global optimization
• A numerical method to approximate the solutions of nonlinear systems in densifiable sets
• Title not available (Why is that?)

Uses Software

• ABC
• MCS
• CEC 05

This page was built for publication: A deterministic method for continuous global optimization using a dense curve

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1998159)