Sparsity in higher order methods for unconstrained optimization (Q2885474)
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: Sparsity in higher order methods for unconstrained optimization |
scientific article; zbMATH DE number 6037759
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sparsity in higher order methods for unconstrained optimization |
scientific article; zbMATH DE number 6037759 |
Statements
Sparsity in higher order methods for unconstrained optimization (English)
0 references
23 May 2012
0 references
Halley's method
0 references
Newton's methods
0 references
Chebyshev's method: sparse factorization
0 references
tensors
0 references
0.8792363405227661
0 references
0.8459108471870422
0 references
0.8414965867996216
0 references
0.7921319007873535
0 references
0.7878329753875732
0 references
