Hierarchical gradient methods for nonlinear LSQ problems (Q1260942): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q588442
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: Joseph Frédéric Bonnans / rank
 
Normal rank

Revision as of 19:28, 19 February 2024

scientific article
Language Label Description Also known as
English
Hierarchical gradient methods for nonlinear LSQ problems
scientific article

    Statements

    Hierarchical gradient methods for nonlinear LSQ problems (English)
    0 references
    0 references
    0 references
    29 August 1993
    0 references
    The author proposes a variant of the gradient algorithm that consists in a succession of cycles. On an iteration of the cycle, only a subset of the variables is changed; all variables must have changed at the end of a cycle. He applies his idea to nonlinear least squares problems.
    0 references
    0 references
    global convergence
    0 references
    decomposition
    0 references
    hierarchical optimization
    0 references
    gradient algorithm
    0 references
    nonlinear least squares problems
    0 references