Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization

DOI10.1080/10556780601114972MaRDI QIDQ5437525zbMATH OpenOpenAlexFDO

Authors Árpád Bűrmen, Tadej Tuma

Publication date 21 January 2008

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780601114972

zbMATH Keywords

asynchronous parallel optimizationcluster computingconvergence analysisdirect searchdistributed computing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Distributed algorithms (68W15) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Recommendations

• Direct Search Methods on Parallel Machines
• Parallel Gradient Distribution in Unconstrained Optimization
• Asynchronous parallel pattern search for nonlinear optimization
• Revisiting Asynchronous Parallel Pattern Search for Nonlinear Optimization
• Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization

Cites work

• `` Direct Search Solution of Numerical and Statistical Problems
• A convergent variant of the Nelder--Mead algorithm
• A guide to MATLAB for beginners and experienced users. With Kevin R. Coombes, John E. Osborn, and Garrett J. Stuck
• A Simplex Method for Function Minimization
• Asynchronous parallel pattern search for nonlinear optimization
• Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
• CUTE
• Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
• Direct Search Methods on Parallel Machines
• Direct search methods: Then and now
• Frame based methods for unconstrained optimization
• scientific article; zbMATH DE number 2068040 (Why is no real title available?)
• scientific article; zbMATH DE number 879773 (Why is no real title available?)
• scientific article; zbMATH DE number 924427 (Why is no real title available?)
• New inexact parallel variable distribution algorithms
• New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
• On the Convergence of Asynchronous Parallel Pattern Search
• On the convergence of grid-based methods for unconstrained optimization
• On the Convergence of Pattern Search Algorithms
• On the Convergence of the Multidirectional Search Algorithm
• On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
• Parallel Gradient Distribution in Unconstrained Optimization
• Parallel Variable Distribution
• Parallel Variable Transformation in Unconstrained Optimization
• Testing Unconstrained Optimization Software
• The parallel downhill simplex algorithm for unconstrained optimisation
• Theory of Positive Linear Dependence

Cited in

(3)

• Asynchronous parallel pattern search for nonlinear optimization
• Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization
• Revisiting Asynchronous Parallel Pattern Search for Nonlinear Optimization

Describes a project that uses

Uses Software

• PVM
• Matlab

This page was built for publication: Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437525)