Stable factorized quasi-Newton methods for nonlinear least-squares problems (Q5936067): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-0427(00)00539-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069416093 / rank
 
Normal rank

Latest revision as of 10:44, 30 July 2024

scientific article; zbMATH DE number 1612928
Language Label Description Also known as
English
Stable factorized quasi-Newton methods for nonlinear least-squares problems
scientific article; zbMATH DE number 1612928

    Statements

    Stable factorized quasi-Newton methods for nonlinear least-squares problems (English)
    0 references
    0 references
    0 references
    0 references
    7 April 2002
    0 references
    A new approach is considered for solving nonlinear least-squares problems. The proposed stable factorized quasi-Newton methods are based on a QR decomposition. The convergence property and superlinear convergence are proved. Some issues about the practical implementation of the proposed methods are also presented. A brief analysis of the computational cost of the proposed methods versus the original ones is given. Numerical experiments show that the new methods are as effective as the original ones; moreover, as the theoretical analysis shows, the new ones are more stable.
    0 references
    0 references
    quasi-Newton methods
    0 references
    nonlinear least-squares problem
    0 references
    QR decomposition
    0 references
    convergence
    0 references
    numerical experiments
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references