Convergence of quasi-Newton matrices generated by the symmetric rank one update (Q1176575): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q59567942, #quickstatements; #temporary_batch_1708296850199
Property / Wikidata QID
 
Property / Wikidata QID: Q59567942 / rank
 
Normal rank

Revision as of 00:23, 19 February 2024

scientific article
Language Label Description Also known as
English
Convergence of quasi-Newton matrices generated by the symmetric rank one update
scientific article

    Statements

    Convergence of quasi-Newton matrices generated by the symmetric rank one update (English)
    0 references
    0 references
    25 June 1992
    0 references
    Quasi-Newton algorithms for unconstrained nonlinear minimization are update methods. In every update of those algorithms an approximation of the objective function's Hessian matrix is generated to constitute the line search formula. It is still an open problem if for the whole class of quasi-Newton algorithms under reasonable conditions the sequence of generated matrices converges and, furthermore, converges to the true Hessian matrix. This paper shows that for the symmetric rank one update formula the generated matrices converge globally to the true Hessian matrix. The rate of convergence is also considered. The authors give numerical experiments to confirm their theoretical results. Those numerical experiment also show the convergence of the Hessian approximations to be substantially slower for other known quasi-Newton methods.
    0 references
    quasi-Newton algorithms
    0 references
    unconstrained nonlinear minimization
    0 references
    true Hessian matrix
    0 references
    rate of convergence
    0 references
    Hessian approximations
    0 references

    Identifiers

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