Nonlinear least squares — the Levenberg algorithm revisited
DOI10.1017/S033427000000120XzbMATH Open0364.90100OpenAlexW2164422015MaRDI QIDQ4139997FDOQ4139997
Publication date: 1976
Published in: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s033427000000120x
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Rate of convergence, degree of approximation (41A25)
Cited In (32)
- Multi-objective optimization in variably saturated fluid flow
- Parameter estimation in flow through partially saturated porous materials
- Guaranteed ellipse fitting with a confidence region and an uncertainty measure for centre, axes, and orientation
- On a global complexity bound of the Levenberg-marquardt method
- Convergence analysis of Gauss-Newton methods for the complementarity problem
- Levenberg-Marquardt method with singular scaling and applications
- Convergence analysis of a subsampled Levenberg-Marquardt algorithm
- On the convergence of a non-linear ensemble Kalman smoother
- Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm
- A simplified two sample sequentialt-Test
- Finite element analysis of an axisymmetric, thin-walled, nonlinear elastic pressurized torus
- Global complexity bound of the Levenberg–Marquardt method
- On the convergence of a class of nonlinear approximation methods
- Levenberg--Marquardt Methods Based on Probabilistic Gradient Models and Inexact Subproblem Solution, with Application to Data Assimilation
- On a new updating rule of the Levenberg-Marquardt parameter
- A Levenberg-Marquardt method for estimating polygonal regions
- Convergence and complexity analysis of a Levenberg-Marquardt algorithm for inverse problems
- Revisiting fitting monotone polynomials to data
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem
- A review of the parameter estimation problem of fitting positive exponential sums to empirical data
- Finite groups
- A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results
- Parametrization of flow processes in porous media by multiobjective inverse modeling
- Recent advances in trust region algorithms
- Variable Projection Methods for an Optimized Dynamic Mode Decomposition
- A simple Marquardt algorithm for the nonlinear least-squares problem
- Convergence analysis of the general Gauss-Newton algorithm
- Fast and flexible methods for monotone polynomial fitting
- A survey of published programs for best approximation
- Estimating the parameters of the linear compartment model
- Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares
- Least squares methods in maximum likelihood problems
This page was built for publication: Nonlinear least squares — the Levenberg algorithm revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4139997)