A parallel method for finding the global minimum of univariate functions
From MaRDI portal
Publication:1321483
DOI10.1007/BF02207778zbMath0797.90098OpenAlexW1980333922MaRDI QIDQ1321483
Vladimir A. Grishagin, Yaroslav D. Sergeyev
Publication date: 27 April 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02207778
Related Items (17)
Parallel global optimization on GPU ⋮ Adaptive nested optimization scheme for multidimensional global search ⋮ An algorithm for solving global optimization problems with nonlinear constraints ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ On the Least-Squares Fitting of Data by Sinusoids ⋮ Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives ⋮ Numerical methods using two different approximations of space-filling curves for black-box global optimization ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales ⋮ On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods ⋮ Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives ⋮ Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms ⋮ Solving a set of global optimization problems by the parallel technique with uniform convergence ⋮ Efficient multicriterial optimization based on intensive reuse of search information ⋮ GOSH: derivative-free global optimization using multi-dimensional space-filling curves ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization ⋮ Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematical modeling of a parallel global optimization algorithm
- Concurrent stochastic methods for global optimization
- On the convergence of global methods in multiextremal optimization
- Random tunneling by means of acceptance-rejection sampling for global optimization
- Bayesian methods in global optimization
- A global minimization algorithm with parallel iterations
- An exact penalty function method with global convergence properties for nonlinear programming problems
- An algorithm for finding the absolute extremum of a function
- A parallel algorithm for global optimization
- A Sequential Method Seeking the Global Maximum of a Function
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- Global optimization
This page was built for publication: A parallel method for finding the global minimum of univariate functions
