TNPACK—A truncated Newton minimization package for large-scale problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

TNPACK—A truncated Newton minimization package for large-scale problems: I. Algorithm and usage

Full text

Pdf (1.54 MB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 18 , Issue 1 (March 1992) table of contents

Pages: 46 - 70

Year of Publication: 1992

ISSN:0098-3500

Authors

Tamar Schlick	New York Univ., New York, NY
Aaron Fogelson	Univ. of Utah, Salt Lake City

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 43, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/128745.150973 What is a DOI?

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	CoNcus, P., GOLUB, G. H., AND O'LEARY, D.P. A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations. In Sparse Matrix Computation, J. R. Bunch and D. J. Rose, Eds., Academic Press, New York, 1976.
	2	DEMBO, R. S., ANn STEIHAUC~, T. Truncated-Newton algorithms for large-scale unconstrained optimization. Math. Program. 26, (1983), 190-212.
	3	DENNm, JR., J. E., ANn MoR~, J.J. Quasi-Newton methods, motivation and theory. SIAM Rev. 19 (1977), 46-89.
	4	DENNm, JR., J. E., ANn SCSNABEL, R.B. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs, NJ, (1983), 116;-129.
	5	DEUFLHARD, P. Global inexact Newton methods for very large scale nonlinear problems. In Proceedings of the Copper Mountain Conference on Iterative Methods (Copper Mountain, Colorado, Apr. 1-5, 1990).
	6	EISENSTAT, S. C., GURSKY, M. C., SC~ULTZ, M. H., AND SHERMAN, A.H. Yale sparse matrix package, I. The symmetric codes. Int. J. Numer. Meth. Eng. 18 (1982), 1145-1151.
	7	EISENSTAT, S. C., SHULTZ, M. H., AND SHERMAN, A.H. Efficient implementation of sparse symmetric gaussian elimination. In Advances in Computer Methods for Partial Differential Equations, R. Vichnevetsky, Ed., AICA, New Brunswick, NJ, 1975, pp. 33-39.
	8	EISENSTAT, S. C., SHULTZ, M. H., AND SHERMAN, A. H. Application of sparse matrix methods to partial differential equations. In Advances ~n Computer Methods for Parttal Differenttal Equations, R. Vichnevetsky, Ed., AICA, New Brunswick, NJ, 1975, pp. 40-45.
	9	EISENSTAT, S. C., SCHULTZ, M. H., AND SHERMAN, A.H. Algorithms and data structures for sparse symmetric gausslan ehmination SIAM J. Sc~ Stat. Comput. 2 (1981), 225-237.
	10	ERISMAN, A., AND GRIMES, R. Sparse matrices today. SIAM NEWS 22 (May 1989).
	11	FOGELSON, A. L. A mathematical model and numerical method for studying platelet adhemon and aggregation during blood clotting. J. Comput. Phys. 56 (1984), 111-134.
	12	Alan George , Joseph W. Liu, Computer Solution of Large Sparse Positive Definite, Prentice Hall Professional Technical Reference, 1981
	13	J. C. Gilbert , C. Lemaréchal, Some numerical experiments with variable-storage quasi-Newton algorithms, Mathematical Programming: Series A and B, v.45 n.3, p.407-435, Dec. 1989 [doi>10.1007/BF01589113]
	14	GILL, P. E., MURRAY, W., SAUNDERS, M. A, AND WRIGHT, M. H. Computing forwarddifference intervals for numerical optimization SIAM J. Sct. Stat. Comput. 4, (1983), 310-321
	15	GILL, P E., MURRAY, W., AND WRIGHT, M.H. Practical Optimization. Academic Press, New York, 1983
	16	GOLUB, G. H., AND VAN LOAN, C.F. MGtFLx Computations. Johns Hopkins Univ. Press, Baltimore, MD, 1984, 362-379.
	17	D. C. Liu , J. Nocedal, On the limited memory BFGS method for large scale optimization, Mathematical Programming: Series A and B, v.45 n.3, p.503-528, Dec. 1989 [doi>10.1007/BF01589116]
	18	MORE, J., AND THUENTE, D J. On line search algorithms with guaranteed sufficient decrease. Mathematics and Computer Science Division Preprint MCS-P153-0590, Argonne National Laboratory, Argonne, Ill , 1990.
	19	NASH, S.G. Solving nonlinear programming problems using truncated-Newton techniques In Numerical Optimization 1984, P. T. Boggs, R. H. Byrd, and R. B. Schnabel, Eds., SIAM, Philadelphia, 1985, pp. 119-136.
	20	NASH, S. G., AND SORER, A. Assessing a search direction within a truncated Newton method. Oper. Res. Lett. 9 (1990), 219-22i.
	21	NASH, S G., AND SORER, A A general-purpose parallel algorithm for unconstrained optimization. SIAM J. Opt. I (1991), 530-547.
	22	OPPE, T. C., JOUBERT, W. D., AND KINCAID, D. R. NSPCG User's Guide. Version 1.0: A package for solving large sparse linear systems by various iterative methods. Tech Rep CNA-216, Center for Numerical Analysis, The Univ. of Texas at Austin, 1988.
	23	RosE, D. J. A graph-theoretic study of the numerical solution of sparse positive-definite systems of linear equations. In Graph Theory and Computing, R. C. Read, Ed., Academic Press, NY, 1972.
	24	SEHLICK, T. New approaches to potentia! energy minimization and molecular dynamics algorithms Comput. Chem 15 (1991), 251-260..
	25	Tamar Schlick , Aaron Fogelson, TNPACK—a truncated Newton minimization package for large-scale problems: II. Implementation examples, ACM Transactions on Mathematical Software (TOMS), v.18 n.1, p.71-111, March 1992 [doi>10.1145/128745.150975]
	26	SCHLICK, T., HINGERTY, B. E., PESKIN, C. S., OVERTON, M. L., AND BROYDE, S. Search strategies, minimization algorithms, and molecular dynamics simulations for exploring conformational spaces of nucleic acids. In Theoretical B~ochemistry and Molecular Biophystcs, Volume I.' Nuclezc Acids, D. L. Beveridge and R. Lavery, Eds., Adenine Press, Guilderland, New York, 1991, pp. 39-58.
	27	SCHLICK, T., AND OVERTON, M. A powerful truncated Newton method for potential energy minimization. J. Cot,put. Chem. 8 (1987), 1025-1039.

CITED BY 6

	John A. Board, Jr. , Laxmikant V. Kale , Klaus Schulten , Robert D. Skeel , Tamar Schlick, Modeling Biomolecules: Larger Scales, Longer Durations, IEEE Computational Science & Engineering, v.1 n.4, p.19-30, December 1994
	Jorge J. Moré , David J. Thuente, Line search algorithms with guaranteed sufficient decrease, ACM Transactions on Mathematical Software (TOMS), v.20 n.3, p.286-307, Sept. 1994
	Stefano Lucidi , Massimo Roma, Numerical Experiences with New Truncated Newton Methodsin Large Scale Unconstrained Optimization, Computational Optimization and Applications, v.7 n.1, p.71-87, Jan. 1997
	Tamar Schlick , Aaron Fogelson, TNPACK—a truncated Newton minimization package for large-scale problems: II. Implementation examples, ACM Transactions on Mathematical Software (TOMS), v.18 n.1, p.71-111, March 1992
	L. Ros , F. Thomas, Overcoming Superstrictness in Line Drawing Interpretation, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.24 n.4, p.456-466, April 2002
	Zhi Wang , K. Droegemeier , L. White, The Adjoint Newton Algorithm for Large-Scale Unconstrained Optimization in Meteorology Applications, Computational Optimization and Applications, v.10 n.3, p.283-320, July 1998