A. Buckley
Supplemental Material
Available for Download
a variable storage Fortran subprogram for function minimization Gams: G1b1a,G1b1b
- 1 ANSI. Programming Language FORTRAN, ANSI X3.9-1966. American National Standards Institute, New York, 1966.Google Scholar
- 2 ANSI. Programming Language FORTRAN, ANSI X3.9-1978. American National Standards Institute, New York, 1978; International Standard ISO 1539-1980(E).Google Scholar
- 3 BUCKLEY, A. A portable package for testing minimization algorithms, in Evaluating Mathematical Programming Techniques. John M. Mulvey, ed. Springer-Verlag, New York, 1982.Google Scholar
- 4 BUCKLEY, A. AND LENIR, A. QN-like variable storage conjugate gradients. Math Prog. 27 (1983), 155-175.Google Scholar
- 5 RYDER, B.G. The PFORT Verifier, Softw. Prac. and Exper. 4 (1974), 359-377.Google Scholar
- 6 SHANNO, D. F. AND PHUA, K.H. Remark on Algorithm 500. ACM Trans. Math. Softw. 6, 4 (1980), 618-622. Google Scholar
Index Terms
- Algorithm 630: BBVSCG–a variable-storage algorithm for function minimization
Recommendations
Local and superlinear convergence of quasi-Newton methods based on modified secant conditions
For solving unconstrained minimization problems, quasi-Newton methods are popular iterative methods. The secant condition which employs only the gradient information is imposed on these methods. Several researchers paid attention to other secant ...
The least prior deviation quasi-Newton update
We propose a new choice for the parameter in the Broyden class and derive and discuss properties of the resulting self-complementary quasi-Newton update. Our derivation uses a variational principle that minimizes the extent to which the quasi-Newton ...
Non-asymptotic superlinear convergence of standard quasi-Newton methods
AbstractIn this paper, we study and prove the non-asymptotic superlinear convergence rate of the Broyden class of quasi-Newton algorithms which includes the Davidon–Fletcher–Powell (DFP) method and the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method. The ...
Comments