Beale, E.M.L. (1972), “A Derivation of Conjugate Gradients,” in Numerical Methods for Nonlinear Optimization, ed. F.A. Lootsma, London: Academic Press.

Dennis, J.E., Gay, D.M., and Welsch, R.E. (1981), “An Adaptive Nonlinear Least-Squares Algorithm,” ACM Transactions on Mathematical Software, 7, 348–368.

Dennis, J.E. and Mei, H.H.W. (1979), “Two New Unconstrained Optimization Algorithms Which Use Function and Gradient Values,” J. Optim. Theory Appl., 28, 453–482.

Dennis, J.E. and Schnabel, R.B. (1983), Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Englewood, NJ: Prentice-Hall.

Fletcher, R. (1987), Practical Methods of Optimization, Second Edition, Chichester: John Wiley & Sons, Inc.

Gay, D.M. (1983), “Subroutines for Unconstrained Minimization,” ACM Transactions on Mathematical Software, 9, 503–524.

Moré, J.J. (1978), “The Levenberg-Marquardt Algorithm: Implementation and Theory,” in Lecture Notes in Mathematics 630, ed. G.A. Watson, Berlin-Heidelberg-New York: Springer Verlag.

Moré, J.J. and Sorensen, D.C. (1983), “Computing a Trust-region Step,” SIAM Journal on Scientific and Statistical Computing, 4, 553–572.

Polak, E. (1971), Computational Methods in Optimization, New York: Academic Press.

Powell, J.M.D. (1977), “Restart Procedures for the Conjugate Gradient Method,” Math. Prog., 12, 241–254.