Convergence and complexity analysis of a Levenberg-Marquardt algorithm for inverse problems
From MaRDI portal
Publication:2188951
Abstract: The Levenberg-Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems. Across different modified variations of the basic procedure, the algorithm enjoys global convergence, a competitive worst case iteration complexity rate, and a guaranteed rate of local convergence for both zero and nonzero small residual problems, under suitable assumptions. We introduce a novel Levenberg-Marquardt method that matches, simultaneously, the state of the art in all of these convergence properties with a single seamless algorithm. Numerical experiments confirm the theoretical behavior of our proposed algorithm.
Recommendations
- Quadratic convergence of Levenberg-Marquardt method for general nonlinear inverse problems with two parameters
- On a regularized Levenberg-Marquardt method for solving nonlinear inverse problems
- Logarithmic convergence rate of Levenberg-Marquardt method with application to an inverse potential problem
- Levenberg-Marquardt method with general convex penalty for nonlinear inverse problems
- Convergence analysis of the Levenberg–Marquardt method
Cites work
- scientific article; zbMATH DE number 1694914 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A family of Newton methods for nonsmooth constrained systems with nonisolated solutions
- A method for the solution of certain non-linear problems in least squares
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Benchmarking optimization software with performance profiles.
- Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
- Convergence rate of the trust region method for nonlinear equations under local error bound condition
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem
- Global complexity bound of the Levenberg-Marquardt method
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Levenberg-Marquardt methods based on probabilistic gradient models and inexact subproblem solution, with application to data assimilation
- Nonlinear least squares — the Levenberg algorithm revisited
- On a global complexity bound of the Levenberg-marquardt method
- On the inexactness level of robust Levenberg-Marquardt methods
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Rank-deficient nonlinear least squares problems and subset selection
- Testing Unconstrained Optimization Software
Cited in
(20)- A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Least-Squares Problems
- A stochastic Levenberg-Marquardt method using random models with complexity results
- A robust method based on LOVO functions for solving least squares problems
- Local convergence analysis of the Levenberg-Marquardt framework for nonzero-residue nonlinear least-squares problems under an error bound condition
- Convergence of Levenberg-Marquardt method for the inverse problem with an interior measurement
- Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence
- The Levenberg-Marquardt iteration for numerical inversion of the power density operator
- Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations
- The Levenberg-Marquardt method: an overview of modern convergence theories and more
- Levenberg-Marquardt method with singular scaling and applications
- A novel study on the MUSIC-type imaging of small electromagnetic inhomogeneities in the limited-aperture inverse scattering problem
- A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations
- Complexity analysis of regularization methods for implicitly constrained least squares
- Logarithmic convergence rate of Levenberg-Marquardt method with application to an inverse potential problem
- Quadratic convergence of Levenberg-Marquardt method for general nonlinear inverse problems with two parameters
- Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares
- On stable parameter estimation and forecasting in epidemiology by the Levenberg-Marquardt algorithm with Broyden's rank-one updates for the Jacobian operator
- Convergent least-squares optimization methods for variational data assimilation
- A stochastic iteratively regularized Gauss-Newton method
- Convergence analysis of a subsampled Levenberg-Marquardt algorithm
This page was built for publication: Convergence and complexity analysis of a Levenberg-Marquardt algorithm for inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188951)
