Convergence properties of the Beale-Powell restart algorithm (Q1286637)

From MaRDI portal
Revision as of 18:48, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Convergence properties of the Beale-Powell restart algorithm
scientific article

    Statements

    Convergence properties of the Beale-Powell restart algorithm (English)
    0 references
    23 August 1999
    0 references
    The authors give an example showing that the Beale-Powell restart algorithm [cf. \textit{E. M. L. Beale}, Numer. Math. non-lin. Optim., Conf., Univ. Dundee 1971, 39-43 (1972; Zbl 0279.65052) and \textit{M. J. D. Powell}, Math. Program. 12, 241-254 (1977; Zbl 0396.90072)] for large-scale unconstrained optimization may fail to converge. The global convergence of a slightly modified algorithm is proved.
    0 references
    unconstrained optimization
    0 references
    conjugate gradient
    0 references
    linear search
    0 references
    Beale-Powell restart algorithm
    0 references
    large-scale unconstrained optimization
    0 references
    global convergence
    0 references
    0 references
    0 references

    Identifiers