On the Convergence of Asynchronous Parallel Pattern Search


In this paper we prove global convergence for asynchronous parallel pattern search. In standard pattern search, decisions regarding the update of the iterate and the step-length control parameter are synchronized implicitly across all search directions. We lose this feature in asynchronous parallel pattern search since the search along each direction proceeds semiautonomously. By bounding the value of the step-length control parameter after any step that produces decrease along a single search direction, we can prove that all the processes share a common accumulation point and, if the function is continuously differentiable, that such a point is a stationary point of the standard nonlinear unconstrained optimization problem.

SIAM Journal on Optimization
T. G. Kolda, V. Torczon. On the Convergence of Asynchronous Parallel Pattern Search. SIAM Journal on Optimization, Vol. 14, No. 4, pp. 939-964, 2004. https://doi.org/10.1137/S1052623401398107


asynchronous parallel optimization, pattern search, unconstrained optimization, global convergence analysis


author = {Tamara G. Kolda and Virginia Torczon}, 
title = {On the Convergence of Asynchronous Parallel Pattern Search}, 
journal = {SIAM Journal on Optimization}, 
volume = {14}, 
number = {4}, 
pages = {939--964}, 
month = {May}, 
year = {2004},
doi = {10.1137/S1052623401398107},