Abstract
A family of test-problems is described which is designed to investigate the relative efficiencies of general optimisation algorithms and specialised algorithms for the solution of nonlinear sums-of-squares problems. Five algorithms are tested on three members of the family, and it is shown that the best choice of algorithms is critically affected by the value of one parameter in the test functions.
Similar content being viewed by others
References
Y. Bard, “Comparison of gradient methods for the solution of nonlinear parameter estimation problems”,SIAM Journal on Numerical Analysis 7 (1970) 157–186.
M.J. Box, “A comparison of several current optimisation methods, and the use of transformations in constrained problems”,The Computer Journal 9 (1966) 67–77.
L.C.W. Dixon, “The choice of step length a crucial factor in the performance of variable metric algorithms”, N.O.C. Tech. Rept. 27, Hatfield Polytechnic (1971).
L.C.W. Dixon,Nonlinear optimisation (English Universities Press Ltd.) p. 43.
J.J. McKeown, “A comparison of methods for solving nonlinear parameter estimation problems”, I.F.A.C. Conference on identification and system parameter estimation (1973).
R.R. Meyer, “Theoretical and computational aspects of nonlinear regression”, in: J.B. Rosen, O.L. Mangasarian and K. Ritter, eds.,Nonlinear programming (Academic Press, New York, 1970).
B.A. Murtagh and R.W.H. Sargent, “Computational experience with quadratically convergent minimisation methods”,The Computer Journal 13 (1970) 185–194.
J. Pitha and R. Norman Jones, “A comparison of optimisation methods for fitting curves to infrared band envelopes”,Canadian Journal of Chemistry 44 (1966) 3031–3050.
M.J.D. Powell, “A method for minimising a sum-of-squares of nonlinear functions without calculating derivatives”,The Computer Journal 7 (1965) 303–307.
M.J.D. Powell, Subroutine VA05A, A.E.R.E. Harwell library subroutine (1969).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
McKeown, J.J. Specialised versus general-purpose algorithms for minimising functions that are sums of squared terms. Mathematical Programming 9, 57–68 (1975). https://doi.org/10.1007/BF01681330
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01681330