This paper describes a Fortran 90 implementation of ACM Transactions on Mathematical Software Algorithm 630, a minimization algorithm designed for use in a limited-memory environment. It includes implementation of the Buckley-LeNir method, Nocedal's limited memory algorithm, and an experimental limited-memory implementation of a factored update due to Powell, as well as a fairly standard quasi-Newton implementation due originally to Shanno. This algorithm uses a number of the new features of Fortran 90 to offer capabilities that were not formerly available.
No takes yet. Share an insight, caveat, or question.
A. Buckley (1994) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: