Global complexity bound of the Levenberg–Marquardt method (Q2829563): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jin Yan Fan / rank
Normal rank
 
Property / author
 
Property / author: Jin Yan Fan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556788.2016.1179737 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2346412421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Levenberg-Marquardt parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified Gauss–Newton scheme with worst case guarantees for global performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear least squares — the Levenberg algorithm revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a global complexity bound of the Levenberg-marquardt method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact Levenberg-Marquardt method for large sparse nonlinear least squres / rank
 
Normal rank

Latest revision as of 21:11, 12 July 2024

scientific article
Language Label Description Also known as
English
Global complexity bound of the Levenberg–Marquardt method
scientific article

    Statements

    Global complexity bound of the Levenberg–Marquardt method (English)
    0 references
    0 references
    0 references
    8 November 2016
    0 references
    nonlinear equations
    0 references
    Levenberg-Marquardt method
    0 references
    global complexity bound
    0 references

    Identifiers