An Adaptive Nonlinear Least-Squares Algorithm

ALLEN D M Private commumcatlon 1976 ALLEN D M Private commumcatlon 1976

BARD Y Comparison of gradmnt methods for the solutmn of nonhnear parameter estimation problems SIAM J Numer Anal 7 (1970) 157-186 BARD Y Comparison of gradmnt methods for the solutmn of nonhnear parameter estimation problems SIAM J Numer Anal 7 (1970) 157-186

BARD Y Nonltnear Parameter Esttmatmn Academic Press New York 1974 BARD Y Nonltnear Parameter Esttmatmn Academic Press New York 1974

BATES D M, 1979, Ont.

BETTS J T Solving the nonhnear least squazes problem Apphcatlon of a general method J Optzm Theory Appl 18 (1976) 469-484 BETTS J T Solving the nonhnear least squazes problem Apphcatlon of a general method J Optzm Theory Appl 18 (1976) 469-484

Box M J A comparison of several current optimization methods and the use of transformations m constrained problems Comput J 9 (1966) 67-77 Box M J A comparison of several current optimization methods and the use of transformations m constrained problems Comput J 9 (1966) 67-77

BRANIN F H Widely convergent method for finding multiple solutions of simultaneous nonlinear equations IBM J Res Develop 16 (197I) 504-522 BRANIN F H Widely convergent method for finding multiple solutions of simultaneous nonlinear equations IBM J Res Develop 16 (197I) 504-522

BROWN K M, 1971, Academm Press, 391

CRAG(~ E E AND LEVY A V Study on a supermemory gradient method for the minimization of functmns J Optzm Theory Appl 4 (1969) 191-205 CRAG(~ E E AND LEVY A V Study on a supermemory gradient method for the minimization of functmns J Optzm Theory Appl 4 (1969) 191-205

DAVIDON W C New least-square algorithms J Opttm Theory Appl 18 (I976) 187-i97. DAVIDON W C New least-square algorithms J Opttm Theory Appl 18 (I976) 187-i97.

DENNIS J E, 1973, Academm Press, t57

DENNIS J E, 1977, Academic Press, 269

DENNIS J E AND MEI H.H-W Two new unconstrained optimization algorithms which use functmn and gradmnt values J Opttm Theory Appl 28 (1979) 453-482 DENNIS J E AND MEI H.H-W Two new unconstrained optimization algorithms which use functmn and gradmnt values J Opttm Theory Appl 28 (1979) 453-482

DENNIS J E AND MORI~ J J Quasi-Newton methods motivatmn and theory SIAM Rev 19 (1977) 46-89 DENNIS J E AND MORI~ J J Quasi-Newton methods motivatmn and theory SIAM Rev 19 (1977) 46-89

DENNm J.E AND WF.LSCH R E. Techmques for nonhnear least squares and robust regress|on. Commun Stattst B7 (I978) 345-359 DENNm J.E AND WF.LSCH R E. Techmques for nonhnear least squares and robust regress|on. Commun Stattst B7 (I978) 345-359

ENGVALL. J L Numerical algomthm for solving over-determined systems of nonlinear equatmns NASA Document N70-35600 1966 ENGVALL. J L Numerical algomthm for solving over-determined systems of nonlinear equatmns NASA Document N70-35600 1966

FLETCHER 1:~ Function minimization without evaluating derlvatlves--A review Comput J 8 (1965) 33-41 FLETCHER 1:~ Function minimization without evaluating derlvatlves--A review Comput J 8 (1965) 33-41

FLETCI F~R, 1971, AERE

FLETCHER R., 1963, A rapidly convergent descent method for minimization, Comput J, 6, 163, 10.1093/comjnl/6.2.163

10.1145/321186.321200

GA'~ D M, 1981, Comput, 2, 2

GILL P E, 1978, Algorithm for the solution of the nonlinear least-squares problem SIAM J Numer, Anal, 15, 977

GOLUB G H, 1969, Academic Press, 365

JENNR H, 1968, Apphcation of step-wise regression to nonlinear estimation, Technometmcs, 10, 63, 10.1080/00401706.1968.10490535

KOWALIK J S AND OSBORNE M R Methods for Unconstrazned Opttmlzatton Problems American Elsevier New York 1968 KOWALIK J S AND OSBORNE M R Methods for Unconstrazned Opttmlzatton Problems American Elsevier New York 1968

MEYER R R, 1970, Academm Press

MORE J J, 1978, Sprmger-Verlag, 105

MORR J J, 1979, Cambridge Umv

OREN S S Self-scaling variable metric algorithms without line search for unconstrained minimization Math Comput 27 {i973) 873-885. OREN S S Self-scaling variable metric algorithms without line search for unconstrained minimization Math Comput 27 {i973) 873-885.

OSBORNE M R, 1972, Academic Press

POWELL M J D An iteratlve method for finding stationary values of a function of several variables Comput J 5 {1962) 147-151 POWELL M J D An iteratlve method for finding stationary values of a function of several variables Comput J 5 {1962) 147-151

POWELL M J, 1970, AERE Harwell

PRATT J W, 1977, Mass.

RAO C R, 1973, Wiley

REINSCH C H, 1971, Smoothing by sphne functions, II Numer Math, 16, 451, 10.1007/BF02169154

ROSENBROCK H H An automatic method for finding the greatest or least value of a function Comput J 3 (1960) 175-184 ROSENBROCK H H An automatic method for finding the greatest or least value of a function Comput J 3 (1960) 175-184

WEDIN P-A, 1972, Lund Umv

WE IN, 1974, Inst for Tellampad Matematlk

WE IN, 1974, Inst for Tellampad Matematik

ZANGWILL W J Nonhnear programming via penalty functmns Manage Sc~ 13 (1967) 344- 358 ZANGWILL W J Nonhnear programming via penalty functmns Manage Sc~ 13 (1967) 344- 358