2018
DOI: 10.1063/1.5082064
|View full text |Cite
|
Sign up to set email alerts
|

A differential evolution algorithm in the optimization task with a Lipschitz continuous cost function

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…Differential Evolutionary algorithms iteratively attempt to improve a candidate hyperparameter combinations by performing “crossover” with other candidate hyperparameters, resulting in novel combinations. Unlike other approaches, they use stochastic processes instead of gradient ones, which allow them to be effective in exploring high-dimensional search spaces (Knobloch, 2018; Storn & Price, 1997).…”
Section: Methodsmentioning
confidence: 99%
“…Differential Evolutionary algorithms iteratively attempt to improve a candidate hyperparameter combinations by performing “crossover” with other candidate hyperparameters, resulting in novel combinations. Unlike other approaches, they use stochastic processes instead of gradient ones, which allow them to be effective in exploring high-dimensional search spaces (Knobloch, 2018; Storn & Price, 1997).…”
Section: Methodsmentioning
confidence: 99%
“…Because these algorithms are population-based stochastic algorithms, their solution quality is far superior to that of traditional optimization techniques because of fewer parameters, high convergence speed, simplicity implementation [7]. It can be divided into three categories: i) Evolutionary Algorithms (EA), like Genetic Algorithm (GA) [8], A Differential Evolution Algorithm (DE) [9]. ii) physics-based algorithms, like gravitational search algorithm (GSA) [10],Harmony Search Algorithm [11] and Simulated Annealing [12].iii) Swarm intelligence (SI)-based algorithm, like Particle Swarm (PSO) [13],…”
Section: Introductionmentioning
confidence: 99%