APPSPACK

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. (Source: http://dl.acm.org/)

This software is also peer reviewed by journal TOMS.


References in zbMATH (referenced in 25 articles , 1 standard article )

Showing results 1 to 20 of 25.
Sorted by year (citations)

1 2 next

  1. Larson, Jeffrey; Wild, Stefan M.: Asynchronously parallel optimization solver for finding multiple minima (2018)
  2. Liuzzi, G.; Truemper, K.: Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch (2018)
  3. Gao, Guohua; Vink, Jeroen C.; Chen, Chaohui; El Khamra, Yaakoub; Tarrahi, Mohammadali: Distributed Gauss-Newton optimization method for history matching problems with multiple best matches (2017)
  4. Mondal, Sukanto; Lucet, Yves; Hare, Warren: Optimizing horizontal alignment of roads in a specified corridor (2015)
  5. Audet, C.; Dang, C.-K.; Orban, D.: Efficient use of parallelism in algorithmic parameter optimization applications (2013)
  6. Regis, Rommel G.: An initialization strategy for high-dimensional surrogate-based expensive black-box optimization (2013)
  7. Le Digabel, Sébastien: Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm (2011)
  8. Lee, Herbert K. H.; Gramacy, Robert B.; Linkletter, Crystal; Gray, Genetha A.: Optimization subject to hidden constraints via statistical emulation (2011)
  9. Shuttleworth, Robert R.; Elman, Howard C.; Long, Kevin R.; Templeton, Jeremy A.: Fast solvers for models of ICEO microfluidic flows (2011)
  10. Begin, T.; Baynat, B.; Sourd, F.; Brandwajn, A.: A DFO technique to calibrate queueing models (2010)
  11. Custódio, A. L.; Rocha, H.; Vicente, L. N.: Incorporating minimum Frobenius norm models in direct search (2010)
  12. Griffin, Joshua D.; Kolda, Tamara G.: Asynchronous parallel hybrid optimization combining DIRECT and GSS (2010)
  13. Griffin, Joshua D.; Kolda, Tamara G.: Nonlinearly constrained optimization using heuristic penalty methods and asynchronous parallel generating set search (2010)
  14. Zhang, Hongchao; Conn, Andrew R.; Scheinberg, Katya: A derivative-free algorithm for least-squares minimization (2010)
  15. Moré, Jorge J.; Wild, Stefan M.: Benchmarking derivative-free optimization algorithms (2009)
  16. Audet, Charles; Dennis, J. E. jun.; Le Digabel, Sébastien: Parallel space decomposition of the mesh adaptive direct search algorithm (2008)
  17. Griffin, Joshua D.; Kolda, Tamara G.; Lewis, Robert Michael: Asynchronous parallel generating set search for linearly constrained optimization (2008)
  18. Hogea, Cosmina; Davatzikos, Christos; Biros, George: An image-driven parameter estimation problem for a reaction-diffusion glioma growth model with mass effects (2008)
  19. Hogea, Cosmina; Davatzikos, Christos; Biros, George: Brain-tumor interaction biophysical models for medical image registration (2008)
  20. Wild, Stefan M.; Regis, Rommel G.; Shoemaker, Christine A.: ORBIT: Optimization by radial basis function interpolation in trust-regions (2008)

1 2 next