On a global complexity bound of the Levenberg-marquardt method (Q620432): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-010-9731-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109591264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / 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: An inexact Levenberg-Marquardt method for large sparse nonlinear least squres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / 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: On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Trust-Region Methods for Multiscale Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic regularization of Newton method and its global performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularized Newton method for unconstrained convex optimization / 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: A regularized Newton method without line search 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: Q2765625 / rank
 
Normal rank

Latest revision as of 16:50, 3 July 2024

scientific article
Language Label Description Also known as
English
On a global complexity bound of the Levenberg-marquardt method
scientific article

    Statements

    On a global complexity bound of the Levenberg-marquardt method (English)
    0 references
    0 references
    0 references
    19 January 2011
    0 references
    0 references
    Levenberg-Marquardt methods
    0 references
    global complexity bound
    0 references
    scale parameter
    0 references
    0 references