Revisiting Asynchronous Parallel Pattern Search for Nonlinear Optimization
- 1 January 2005
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 16 (2) , 563-586
Abstract
We present a new asynchronous parallel pattern search (APPS) method which is different from that developed previously by Hough, Kolda, and Torczon. APPS efficiently uses parallel and distributed computing platforms to solve science and engineering design optimization problems where derivatives are unavailable and cannot be approximated. The original APPS was designed to be fault-tolerant as well as asynchronous and was based on a peer-to-peer design. Each process was in charge of a single, fixed search direction. Our new version is based instead on a manager-worker paradigm. Though less fault-tolerant, the resulting algorithm is more flexible in its use of distributed computing resources. We further describe how to incorporate a zero-order sufficient decrease condition and handle bound constraints. Convergence theory for all situations (unconstrained and bound constrained as well as simple and sufficient decrease) is developed. We close with a discussion of how the new APPS will better facilitate the future incorporation of linear and nonlinear constraints.Keywords
This publication has 16 references indexed in Scilit:
- On the Convergence of Asynchronous Parallel Pattern SearchSIAM Journal on Optimization, 2004
- Optimization by Direct Search: New Perspectives on Some Classical and Modern MethodsSIAM Review, 2003
- A Derivative-Free Algorithm for Bound Constrained OptimizationComputational Optimization and Applications, 2002
- Analysis of Generalized Pattern SearchesSIAM Journal on Optimization, 2002
- On the Global Convergence of Derivative-Free Methods for Unconstrained OptimizationSIAM Journal on Optimization, 2002
- New Sequential and Parallel Derivative-Free Algorithms for Unconstrained MinimizationSIAM Journal on Optimization, 2002
- Asynchronous Parallel Pattern Search for Nonlinear OptimizationSIAM Journal on Scientific Computing, 2001
- Pattern Search Methods for Linearly Constrained MinimizationSIAM Journal on Optimization, 2000
- Pattern Search Algorithms for Bound Constrained MinimizationSIAM Journal on Optimization, 1999
- A high-performance, portable implementation of the MPI message passing interface standardParallel Computing, 1996