An asynchronous parallel Newton method (Q1116895): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3810792 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automatic differentiation: techniques and applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Arithmetic of Differentiation / rank | |||
Normal rank | |||
Latest revision as of 13:18, 19 June 2024
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
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
