Algorithm 1007: QNSTOP-Quasi-Newton Algorithm for Stochastic Optimization

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

QNSTOP consists of serial and parallel (OpenMP) Fortran 2003 codes for the quasi-Newton stochastic optimization method of Castle and Trosset for stochastic search problems. A complete description of QNSTOP for both local search with stochastic objective and global search with "noisy" deterministic objective is given here, to the best of our knowledge, for the first time. For stochastic search problems, some convergence theory exists for particular algorithmic choices and parameter values. Both the parallel driver subroutine, which offers several parallel decomposition strategies, and the serial driver subroutine can be used for local stochastic search or global deterministic search, based on an input switch. Some performance data for computational systems biology problems is given.

Cite

CITATION STYLE

APA

Amos, B. D., Easterling, D. R., Watson, L. T., Thacker, W. I., Castle, B. S., & Trosset, M. W. (2020). Algorithm 1007: QNSTOP-Quasi-Newton Algorithm for Stochastic Optimization. ACM Transactions on Mathematical Software, 46(2). https://doi.org/10.1145/3374219

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free