A modified Levenberg-Marquardt method with line search for nonlinear equations (Q2374368): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q179290
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: A. I. Iliev / rank
 
Normal rank

Revision as of 10:52, 10 February 2024

scientific article
Language Label Description Also known as
English
A modified Levenberg-Marquardt method with line search for nonlinear equations
scientific article

    Statements

    A modified Levenberg-Marquardt method with line search for nonlinear equations (English)
    0 references
    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

    Identifiers