APPSPACK is software for solving unconstrained and bound-constrained optimization problems. It implements an asynchronous parallel pattern search method that has been specifically designed for problems characterized by expensive function evaluations. Using APPSPACK to solve optimization problems has several advantages: No derivative information is needed; the procedure for evaluating the objective function can be executed via a separate program or script; the code can be run serially or in parallel, regardless of whether the function evaluation itself is parallel; and the software is freely available. We describe the underlying algorithm, data structures, and features of APPSPACK version 4.0, as well as how to use and customize the software.
%0 Journal Article
%1 gray2006algorithm
%A Gray, Genetha A.
%A Kolda, Tamara G.
%C New York, NY, USA
%D 2006
%I ACM
%J ACM Trans. Math. Softw.
%K optimization pcg_optimization pcg_optimization_apps
%N 3
%P 485-507
%R 10.1145/1163641.1163647
%T Algorithm 856: APPSPACK 4.0: Asynchronous Parallel Pattern Search for Derivative-free Optimization
%U http://doi.acm.org/10.1145/1163641.1163647
%V 32
%X APPSPACK is software for solving unconstrained and bound-constrained optimization problems. It implements an asynchronous parallel pattern search method that has been specifically designed for problems characterized by expensive function evaluations. Using APPSPACK to solve optimization problems has several advantages: No derivative information is needed; the procedure for evaluating the objective function can be executed via a separate program or script; the code can be run serially or in parallel, regardless of whether the function evaluation itself is parallel; and the software is freely available. We describe the underlying algorithm, data structures, and features of APPSPACK version 4.0, as well as how to use and customize the software.
@article{gray2006algorithm,
abstract = {APPSPACK is software for solving unconstrained and bound-constrained optimization problems. It implements an asynchronous parallel pattern search method that has been specifically designed for problems characterized by expensive function evaluations. Using APPSPACK to solve optimization problems has several advantages: No derivative information is needed; the procedure for evaluating the objective function can be executed via a separate program or script; the code can be run serially or in parallel, regardless of whether the function evaluation itself is parallel; and the software is freely available. We describe the underlying algorithm, data structures, and features of APPSPACK version 4.0, as well as how to use and customize the software.},
acmid = {1163647},
added-at = {2015-11-04T11:38:37.000+0100},
address = {New York, NY, USA},
author = {Gray, Genetha A. and Kolda, Tamara G.},
biburl = {https://www.bibsonomy.org/bibtex/2b4e031f522e817681c1f4403c7d50ba5/einar90},
doi = {10.1145/1163641.1163647},
interhash = {4221cb800f06beeacddd27fbcb965185},
intrahash = {b4e031f522e817681c1f4403c7d50ba5},
issn = {0098-3500},
issue_date = {September 2006},
journal = {ACM Trans. Math. Softw.},
keywords = {optimization pcg_optimization pcg_optimization_apps},
month = sep,
number = 3,
numpages = {23},
pages = {485-507},
publisher = {ACM},
timestamp = {2015-11-04T11:38:37.000+0100},
title = {Algorithm 856: APPSPACK 4.0: Asynchronous Parallel Pattern Search for Derivative-free Optimization},
url = {http://doi.acm.org/10.1145/1163641.1163647},
volume = 32,
year = 2006
}