A modified secant method for unconstrained minimization
- Polak, E.
- JAN 1, 1972.
- Physical Description:
- 1 electronic document
- Restrictions on Access:
- Unclassified, Unlimited, Publicly available.
- A gradient-secant algorithm for unconstrained optimization problems is presented. The algorithm uses Armijo gradient method iterations until it reaches a region where the Newton method is more efficient, and then switches over to a secant form of operation. It is concluded that an efficient method for unconstrained minimization has been developed, and that any convergent minimization method can be substituted for the Armijo gradient method.
- NASA Technical Reports Server (NTRS) Collection.
- Document ID: 19730011906.
Accession ID: 73N20633.
- No Copyright.
View MARC record | catkey: 15749836