An asynchronous parallel Newton method (Q1116895)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An asynchronous parallel Newton method |
scientific article; zbMATH DE number 4089337
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asynchronous parallel Newton method |
scientific article; zbMATH DE number 4089337 |
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
0.95649254
0 references
0 references
0.92666566
0 references
0.9260392
0 references
0.9169839
0 references
0.91639787
0 references
0.90895927
0 references
