The convergence of quasi-Newton matrices generated by the self-scaling symmetric rank one update (Q1267799)

From MaRDI portal
Revision as of 02:44, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The convergence of quasi-Newton matrices generated by the self-scaling symmetric rank one update
scientific article

    Statements

    The convergence of quasi-Newton matrices generated by the self-scaling symmetric rank one update (English)
    0 references
    0 references
    16 June 1999
    0 references
    Quasi-Newton algorithms for unconstrained optimization generate a sequence of matrices that can be considered as approximations to the objective function second derivatives. This paper gives some conditions under which the approximations generated by the self-scaling symmetric rank one update formula [\textit{L. P. Sun}, J. Comput. Math. Chinese Univ. 3, 15-25 (1984)] can be proved to converge globally to the true correct Hessian matrix. The theory is confirmed by preliminary numerical tests.
    0 references
    quasi-Newton algorithms
    0 references
    convergence
    0 references
    numerical examples
    0 references
    unconstrained optimization
    0 references
    self-scaling symmetric rank one update formula
    0 references

    Identifiers