A discrete Newton algorithm for minimizing a function of many variables

Dianne P. O'Leary

doi:10.1007/bf01583777

journal article Dec 01, 1982

A discrete Newton algorithm for minimizing a function of many variables

Dianne P. O'Leary

Mathematical Programming Vol. 23 No. 1 pp. 20-33 · Springer Science and Business Media LLC

View at Publisher Save 10.1007/bf01583777

Topics

No keywords indexed for this article. Browse by subject →

References

29

[1]

W. Murray,Numerical methods for unconstrained optimization (Academic Press, New York, 1972).

[2]

D.P. O'Leary, “A discrete Newton algorithm for minimizing a function of many variables”, Computer Science Department Report TR-910, University of Maryland (June 1980).

[3]

R.P. Brent, “Some efficient algorithms for solving systems of nonlinear equations”,SIAM Journal on Numerical Analysis 10 (1973) 327–344. 10.1137/0710031

[4]

A.R. Curtis, M.J.D. Powell and J.K. Reid, “On the estimation of sparse Jacobian matrices”,Journal of the Institute of Mathematics and its Applications 13 (1974) 117–119. 10.1093/imamat/13.1.117

[5]

M.J.D. Powell and Ph.L. Toint, “On the estimation of sparse Hessian matrices”,SIAM Journal on Numerical Analysis 16 (1979) 1060–1074. 10.1137/0716078

[6]

M.C. Bartholomew-Biggs, “A matrix modification method for calculating approximate solutions to systems of linear equations”,Journal of the Institute of Mathematics and its Applications 23 (1979) 131–137. 10.1093/imamat/23.2.131

[7]

P.E. Gill and W. Murray, “Newton-type methods for unconstrained and linearly constrained optimization”,Mathematical Programming 7 (1974) 311–350. 10.1007/bf01585529

[8]

S. Kaniel and A. Dax, “A modified Newton's method for unconstrained minimization”,SIAM Journal on Numerical Analysis 16 (1979) 324–331. 10.1137/0716024

[9]

P.E. Gill and W. Murray, “Newton-type methods for linearly constrained optimization”, in: P.E. Gill and W. Murray, eds.,Numerical methods for constrained optimization (Academic Press, New York, 1974) pp. 29–66.

[10]

A.A. Goldstein, “On steepest descent”,SIAM Journal on Control 3 (1965) 147–151.

[11]

M.R. Hestenes and E. Stiefel, “Methods of conjugate gradients for solving linear systems”,Journal of Research of the National Bureau of Standards 49 (1952) 409–436. 10.6028/jres.049.044

[12]

C. Lanczos, “An iteration method for the solution of the eigenvalue problem of linear differential and integral operators”,Journal of Research of the National Bureau of Standards 45 (1950) 255–282. 10.6028/jres.045.026

[13]

C. Lanczos, “Solution of systems of linear equations by minimized iterations”,Journal of Research of the National Bureau of Standards 49 (1952) 33–53. 10.6028/jres.049.006

[14]

Rati Chandra, “Conjugate gradient methods for partial differential equations”, Ph.D. Thesis, Report 129, Department of Computer Science, Yale University (1978).

[15]

C.C. Paige and M.A. Saunders, “Solutions of sparse indefinite systems of linear equations”,SIAM Journal on Numerical Analysis 12 (1975) 617–629. 10.1137/0712047

[16]

J.R. Bunch and B.N. Parlett, “Direct methods for solving symmetric indefinite systems of linear equations”,SIAM Journal on Numerical Analysis 8 (1971) 639–655. 10.1137/0708060

[17]

J.W. Daniel, “The conjugate gradient method for linear and nonlinear operator equations”,SIAM Journal on Numerical Analysis 4 (1967) 10–26. 10.1137/0704002

[18]

S. Kaniel, “Estimates for some computational techniques in linear algebra”,Mathematics of Computation 20 (1966) 369–378. 10.1090/s0025-5718-1966-0234618-4

[19]

O. Axelsson, “Solution of linear systems of equations: Iterative methods”, in: V.A. Barker, ed.,Sparse matrix techniques (Springer-Verlag, New York, 1977).

[20]

P. Concus, G.H. Golub and D.P. O'Leary, “A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations”, in: J.R. Bunch and D.J. Rose, eds.,Sparse matrix computations (Academic Press, New York, 1976) pp. 309–332. 10.1016/b978-0-12-141050-6.50023-4

[21]

M.R. Hestenes,Conjugate direction methods in optimization (Springer-Verlag, New York, 1980). 10.1007/978-1-4612-6048-6

[22]

R.F. Dennemeyer and E.H. Mookini, “CGS algorithms for unconstrained minimization of functions”,Journal of Optimization Theory and Applications 16 (1975) 67–85. 10.1007/bf00935624

[23]

J.M. Ortega and W.C. Rheinboldt,Iterative solution of nonlinear equations in several variables (Academic Press, New York, 1970).

[24]

J.C.P. Bus, “Convergence of Newton-like methods for solving systems of nonlinear equations”,Numerische Mathematik 27 (1977) 271–281. 10.1007/bf01396177

[25]

Conjugate-Gradient Methods for Large-Scale Nonlinear Optimization.

Philip E. Gill, Walter Murray

10.21236/ada078713

[26]

M.R. Osborne, “An efficient weak line search with guaranteed termination”, Report 1870, Mathematics Research Center, University of Wisconsin (1978).

[27]

N.K. Garg and R.A. Tapia, “QDN: A variable storage algorithm for unconstrained optimization”, Department of Mathematical Sciences Report, Rice University (1980).

[28]

R.S. Dembo and T. Steihaug, “Truncated-Newton algorithms for large-scale unconstrained optimization”, School of Organization and Management, Yale University Preliminary Draft (September 1980).

[29]

P.E. Gill, W. Murray and S.G. Nash, “Newton-type minimization using the linear conjugate gradient method”, Draft, Department of Operations Research, Stanford University (October 1980).

Cited By

54

A powerful truncated Newton method for potential energy minimization

Tamar Schlick, Michael Overton · 1987

Journal of Computational Chemistry

Newton-Type Minimization via the Lanczos Method

Stephen G. Nash · 1984

SIAM Journal on Numerical Analysis

Metrics

54

Citations

29

References

Details

Published: Dec 01, 1982
Vol/Issue: 23(1)
Pages: 20-33
License: View

Authors

D

Dianne P. O'Leary

Cite This Article

Dianne P. O'Leary (1982). A discrete Newton algorithm for minimizing a function of many variables. Mathematical Programming, 23(1), 20-33. https://doi.org/10.1007/bf01583777

A discrete Newton algorithm for minimizing a function of many variables

You May Also Like