Algorithm 734

Algorithm 734. A Fortran 90 code for unconstrained nonlinear minimization. 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. (Source: http://dl.acm.org/)

This software is also peer reviewed by journal TOMS.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element


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

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

  1. Hopkins, Tim: Certification of Algorithm 734: A Fortran 90 Code for unconstrained nonlinear minimization (1998)
  2. Buckley, A. G.: Algorithm 734: A Fortran 90 code for unconstrained nonlinear minimization. (1994) ioport
  3. Buckley, A. G.: Algorithm 734. A Fortran 90 code for unconstrained nonlinear minimization (1994)