Nonlinear least squares — the Levenberg algorithm revisited
From MaRDI portal
Publication:4139997
DOI10.1017/S033427000000120XzbMath0364.90100MaRDI QIDQ4139997
Publication date: 1976
Published in: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
41A25: Rate of convergence, degree of approximation
90-04: Software, source code, etc. for problems pertaining to operations research and mathematical programming
Related Items
Finite groups, Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem, On a global complexity bound of the Levenberg-marquardt method, A simple Marquardt algorithm for the nonlinear least-squares problem, Convergence analysis of the general Gauss-Newton algorithm, On the convergence of a class of nonlinear approximation methods, Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm, A survey of published programs for best approximation, Estimating the parameters of the linear compartment model, Convergence analysis of Gauss-Newton methods for the complementarity problem, A review of the parameter estimation problem of fitting positive exponential sums to empirical data, Parameter estimation in flow through partially saturated porous materials, Multi-objective optimization in variably saturated fluid flow, A Levenberg-Marquardt method for estimating polygonal regions, Finite element analysis of an axisymmetric, thin-walled, nonlinear elastic pressurized torus, Least squares methods in maximum likelihood problems, A simplified two sample sequentialt-Test
