Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation (Q2383749)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation
scientific article

    Statements

    Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation (English)
    0 references
    0 references
    0 references
    19 September 2007
    0 references
    The work is a joining and development of the methods of \textit{R.~S.~Dembo, S.~C.~Eisenstat}, and \textit{T.~Steihaug} [SIAM J. Numer. Anal. 19, 400--408 (1982; Zbl 0478.65030)], \textit{R.~S.~Dembo} and \textit{T.~Steihaug} [Math. Program. 26, 190--212 (1983; Zbl 0523.90078)] and \textit{J.~X.~Li} and \textit{H.~W.~Zhang} [Appl. Math. Comput. 186, No. 1, 365--378 (2007; Zbl 1171.65047)]. Local and global versions of the algorithm are considered. A good subject survey and many numerical examples are presented by which this method and similar ones are compared.
    0 references
    unconstrained optimization
    0 references
    truncated Newton-like methods
    0 references
    conjugate gradient algorithms
    0 references
    comparison of methods
    0 references
    numerical examples
    0 references

    Identifiers