A parallel unconstrained quasi-Newton algorithm and its performance on a local memory parallel computer (Q809551)
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: A parallel unconstrained quasi-Newton algorithm and its performance on a local memory parallel computer |
scientific article; zbMATH DE number 4213339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel unconstrained quasi-Newton algorithm and its performance on a local memory parallel computer |
scientific article; zbMATH DE number 4213339 |
Statements
A parallel unconstrained quasi-Newton algorithm and its performance on a local memory parallel computer (English)
0 references
1991
0 references
The author gives a generalization of the parallel quasi-Newton algorithm for unconstrained optimization to a family of parallel symmetric rank-two algorithms and considers an implementation on the Intel iPSC/2 Hypercube.
0 references
performance
0 references
local memory parallel computer
0 references
parallel quasi-Newton algorithm
0 references
unconstrained optimization
0 references
parallel symmetric rank-two algorithms
0 references
Intel iPSC/2 Hypercube
0 references
0 references
0 references
0.8770021796226501
0 references
0.8656507134437561
0 references
0.8545809388160706
0 references
0.8481825590133667
0 references
0.8454134464263916
0 references
