Parallel two-phase methods for global optimization on GPU
From MaRDI portal
Publication:1997322
Recommendations
- Parallel global optimization on GPU
- An efficient implementation of parallel simulated annealing algorithm in GPUs
- Concurrent stochastic methods for global optimization
- Basin hopping with synched multi L-BFGS local searches. Parallel implementation in multi-CPU and GPUs
- Parallel simulated annealing algorithms in global optimization
Cites work
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 2159091 (Why is no real title available?)
- scientific article; zbMATH DE number 906530 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- A Family of Variable-Metric Methods Derived by Variational Means
- A Limited Memory Algorithm for Bound Constrained Optimization
- A Simplex Method for Function Minimization
- A deterministic algorithm for global optimization
- A hybrid simplex search and particle swarm optimization for unconstrained optimization
- A magnetic resonance device designed via global optimization techniques
- A new approach to variable metric algorithms
- A particle swarm pattern search method for bound constrained global optimization
- A survey of nonlinear conjugate gradient methods
- An efficient implementation of parallel simulated annealing algorithm in GPUs
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Conditioning of Quasi-Newton Methods for Function Minimization
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Derivative-free optimization and filter methods to solve nonlinear constrained problems
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- Direct Search Methods on Parallel Machines
- Equation of state calculations by fast computing machines
- Function minimization by conjugate gradients
- Generalized descent for global optimization
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global optimization. Theory, algorithms, and applications
- Handbook of global optimization. Vol. 2
- Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
- Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters
- Line search algorithms with guaranteed sufficient decrease
- Local optima smoothing for global optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- Modification of the Wolfe line search rules to satisfy the descent condition in the Polak-Ribière-Polyak conjugate gradient method
- On the limited memory BFGS method for large scale optimization
- On the multilevel structure of global optimization problems
- Optimization by simulated annealing
- PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
- SIMANN: A Global Optimization Algorithm using Simulated Annealing
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- Simulated annealing: Practice versus theory
- The Convergence of a Class of Double-rank Minimization Algorithms
- The Gradient Projection Method Using Curry’s Steplength
- `` Direct Search Solution of Numerical and Statistical Problems
Cited in
(3)
This page was built for publication: Parallel two-phase methods for global optimization on GPU
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1997322)
