Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization
DOI10.1080/10556780601114972zbMath1169.90449OpenAlexW2012204360MaRDI QIDQ5437525
Publication date: 21 January 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780601114972
convergence analysisdistributed computingcluster computingdirect searchasynchronous parallel optimization
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Parallel numerical computation (65Y05) Distributed algorithms (68W15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A convergent variant of the Nelder--Mead algorithm
- New inexact parallel variable distribution algorithms
- Direct search methods: Then and now
- On the Convergence of Grid-Based Methods for Unconstrained Optimization
- Asynchronous Parallel Pattern Search for Nonlinear Optimization
- A Guide to MATLAB
- On the Convergence of Pattern Search Algorithms
- `` Direct Search Solution of Numerical and Statistical Problems
- Testing Unconstrained Optimization Software
- Direct Search Methods on Parallel Machines
- On the Convergence of the Multidirectional Search Algorithm
- The parallel downhill simplex algorithm for unconstrained optimisation
- Parallel Variable Transformation in Unconstrained Optimization
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Parallel Variable Distribution
- CUTE
- On the Convergence of Asynchronous Parallel Pattern Search
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- Parallel Gradient Distribution in Unconstrained Optimization
- A Simplex Method for Function Minimization
- Theory of Positive Linear Dependence
- Frame based methods for unconstrained optimization
This page was built for publication: Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization
