Algorithm 630

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 630: BBVSCG–a variable-storage algorithm for function minimization

Full text

Pdf (1.31 MB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 11 , Issue 2 (June 1985) table of contents

Pages: 103 - 119

Year of Publication: 1985

ISSN:0098-3500

Authors

A. Buckley	Department of Mathematics, Statistics and Computing Science, Dalhousie University, Halifax, Nova Scotia B3H 4H8, Canada
A. Lenir	Mathematics Department, Concordia University, Montreal, Quebec, H3B 1M8, Canada

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 25, Citation Count: 8

Additional Information:

appendices and supplements references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/214392.214395 What is a DOI?

APPENDICES and SUPPLEMENTS

BBVSCG (630.gz) (164 KB)

a variable storage Fortran subprogram for function minimization
Gams: G1b1a,G1b1b

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	ANSI. Programming Language FORTRAN, ANSI X3.9-1966. American National Standards Institute, New York, 1966.
	2	ANSI. Programming Language FORTRAN, ANSI X3.9-1978. American National Standards Institute, New York, 1978; International Standard ISO 1539-1980(E).
	3	BUCKLEY, A. A portable package for testing minimization algorithms, in Evaluating Mathematical Programming Techniques. John M. Mulvey, ed. Springer-Verlag, New York, 1982.
	4	BUCKLEY, A. AND LENIR, A. QN-like variable storage conjugate gradients. Math Prog. 27 (1983), 155-175.
	5	RYDER, B.G. The PFORT Verifier, Softw. Prac. and Exper. 4 (1974), 359-377.
	6	D. F. Shanno , K. H. Phua, Remark on “Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]”, ACM Transactions on Mathematical Software (TOMS), v.6 n.4, p.618-622, Dec. 1980 [doi>10.1145/355921.355933]

CITED BY 8

	A. G. Buckley, ALGORITHM 709; testing algorithm implementations, ACM Transactions on Mathematical Software (TOMS), v.18 n.4, p.375-391, Dec. 1992
	Ciyou Zhu , Richard H. Byrd , Peihuang Lu , Jorge Nocedal, Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization, ACM Transactions on Mathematical Software (TOMS), v.23 n.4, p.550-560, Dec. 1997
	A. G. Buckley, Conversion to Fortran 90: a case study, ACM Transactions on Mathematical Software (TOMS), v.20 n.3, p.308-353, Sept. 1994
	M. B. Reed, An H-form variant of the partitioned QN method, Applied Numerical Mathematics, v.45 n.1, p.79-85, April 2003
	A. G. Buckley, Algorithm 734; a Fortran 90 code for unconstrained nonlinear minimization, ACM Transactions on Mathematical Software (TOMS), v.20 n.3, p.354-372, Sept. 1994
	A. Buckley, Remark on algorithm 630, ACM Transactions on Mathematical Software (TOMS), v.15 n.3, p.262-274, Sept. 1989
	Walter Murray, Sequential Quadratic Programming Methods for Large-Scale Problems, Computational Optimization and Applications, v.7 n.1, p.127-142, Jan. 1997
	M. B. Reed, L-Broyden methods: a generalization of the L-BFGS method to the limited-memory Broyden family, International Journal of Computer Mathematics, v.86 n.4, p.606-615, April 2009