A modified Levenberg-Marquardt method with line search for nonlinear equations (Q2374368)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6663701
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A modified Levenberg-Marquardt method with line search for nonlinear equations |
scientific article; zbMATH DE number 6663701 |
Statements
A modified Levenberg-Marquardt method with line search for nonlinear equations (English)
0 references
15 December 2016
0 references
To save more Jacobian calculations and achieve a faster convergence rate a new modified Levenberg-Marquardt (LM) method for nonlinear equations is presented. At every iteration, not only the accelerating trial step but also an additional LM step which uses the previous available Jacobian instead of the new Jacobian, is computed in this new method. Under the local error bound condition which is weaker than nonsingularity, the new method has fourth convergence rate. Results of numerical tests are given.
0 references
unconstrained optimization
0 references
nonlinear equations
0 references
Levenberg-Marquardt method
0 references
local error bound
0 references
line search
0 references
convergence
0 references
numerical test
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9089078903198242
0 references
0.8863682746887207
0 references
0.880228579044342
0 references
0.8773877024650574
0 references
