A global minimization algorithm with parallel iterations
From MaRDI portal
Publication:3481175
DOI10.1016/0041-5553(89)90002-5zbMath0702.65064OpenAlexW2018340082MaRDI QIDQ3481175
Yaroslav D. Sergeyev, Roman G. Strongin
Publication date: 1989
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(89)90002-5
parallel algorithmglobal minimizationparallel methodparallel iterationsmulti-extremal functionsone- dimensional unconstrained problem
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Parallel numerical computation (65Y05)
Related Items
On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives ⋮ A direct search algorithm for global optimization ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves ⋮ On convergence of "divide the best" global optimization algorithms ⋮ A parallel method for finding the global minimum of univariate functions
This page was built for publication: A global minimization algorithm with parallel iterations
