APPSPACK Version 3: Asynchronous Parallel Pattern Search
This is the documentation for Version 3 of APPSPACK. For other versions, including the latest development version, visit the main APPSPACK web page.
APPSPACK is a software package for an asynchronous parallel pattern search. Its objective is to enable solution of the problem
Here and .
APPS is an asynchronous and fault tolerant parallel pattern search method for optimization. Pattern search uses only function values for optimization, so it can be applied to a wide variety of problems. Of particular interest to us are engineering optimization design problems characterized by a small number of variables and by expensive objective function evaluations (typically complex simulations that take minutes or hours to run). The name "pattern search" derives from the fact that a pattern of search directions is used to drive the search. Parallelism is achieved by dividing the search directions (and corresponding function evaluations) among the different processors. The "asynchronous" part comes about as a consequence of the fact that the search along each direction continues without waiting for searches along other directions to finish, in contrast to the standard parallel pattern search method. Further, APPS is also fault tolerant so it is not hindered by node failures.
APPSPACK is available for download under the terms of the GNU Lesser General Public License.
For other versions, including the latest development version, visit the main APPSPACK web page.
To reports bugs or make enhancement reuqests, visit APPSPACK's Bugzilla (Bug Tracking) Database, and use the following instructions.
We recommend that users and developers subscribe to the following mailing lists as appropriate.
The following people have contributed code to APPSPACK:
Click on "Enter a new bug report"
Either login or create a new account
Submit your bug report
Please contact Tamara G. Kolda, email@example.com.
P. D. Hough, T. G. Kolda, and V. J. Torczon. Asynchronous Parallel Pattern Search for Nonlinear Optimization. SIAM J. Scientific Computing, 23(1):134-156, June 2001. Abstract and Paper
Tamara G. Kolda and Virginia Torczon. Understanding asynchronous parallel pattern search. Technical Report SAND2001-8695, Sandia National Laboratories, Livermore, California, February 2002. Abstract and Paper
Tamara G. Kolda and Virginia Torczon. On the convergence of asynchronous parallel pattern search Technical Report SAND2001-8696, Sandia National Laboratories, Livermore, California, February 2002. Abstract and Paper
Generated on Mon Oct 27 15:14:47 2003 for APPSPACK by
1.3.4 written by Dimitri van Heesch,