An asynchronous parallel Newton method (Q1116895)

From MaRDI portal
Revision as of 13:18, 19 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An asynchronous parallel Newton method
scientific article

    Statements

    An asynchronous parallel Newton method (English)
    0 references
    0 references
    1988
    0 references
    A parallel Newton method is described for the minimization of a twice continuously differentiable uniformly convex function F(x). The algorithm generates a sequence \(\{x_ j\}\) which converges superlinearly to the global minimizer of F(x).
    0 references
    parallel algorithms
    0 references
    superlinear convergence
    0 references
    parallel Newton method
    0 references
    twice continuously differentiable uniformly convex function
    0 references

    Identifiers

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