Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method
DOI10.1007/S10589-016-9845-XzbMATH Open1383.90038OpenAlexW2344098705MaRDI QIDQ2374367FDOQ2374367
Authors: Elizabeth W. Karas, S. A. Santos, B. F. Svaiter 
Publication date: 15 December 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9845-x
Recommendations
- A note on the Levenberg-Marquardt parameter
- On computing the regularization parameter for the Levenberg-Marquardt method via the spectral radius approach to solving systems of nonlinear equations
- On a new updating rule of the Levenberg-Marquardt parameter
- Local convergence analysis of the Levenberg-Marquardt framework for nonzero-residue nonlinear least-squares problems under an error bound condition
- A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods
regularizationglobal convergenceLevenberg-Marquardt methodlocal convergencecomputational resultsnonlinear least squares problems
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Title not available (Why is that?)
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- A method for the solution of certain non-linear problems in least squares
- Title not available (Why is that?)
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Title not available (Why is that?)
- On the inexactness level of robust Levenberg-Marquardt methods
- Approximate Gauss–Newton Methods for Nonlinear Least Squares Problems
- Recent advances in numerical methods for nonlinear equations and nonlinear least squares
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
- Convergence properties of a self-adaptive Levenberg-Marquardt algorithm under local error bound condition
- On a global complexity bound of the Levenberg-marquardt method
- Algebraic rules for quadratic regularization of Newton's method
- Evaluating bound-constrained minimization software
- Accelerating the modified Levenberg-Marquardt method for nonlinear equations
Cited In (11)
- Levenberg-Marquardt revisited and parameter tuning of river regression models
- Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity
- Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods
- The Levenberg-Marquardt method: an overview of modern convergence theories and more
- A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations
- A modified Levenberg-Marquardt method for solving system of nonlinear equations
- A globally convergent method for nonlinear least-squares problems based on the Gauss-Newton model with spectral correction
- Local convergence analysis of the Levenberg-Marquardt framework for nonzero-residue nonlinear least-squares problems under an error bound condition
- Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations
- A brief survey of methods for solving nonlinear least-squares problems
- A split Levenberg-Marquardt method for large-scale sparse problems
Uses Software
This page was built for publication: Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374367)
