Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization (Q2301133)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7175933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization |
scientific article; zbMATH DE number 7175933 |
Statements
Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization (English)
0 references
28 February 2020
0 references
smooth unconstrained minimization
0 references
cubic modeling
0 references
subspace minimization
0 references
trust-region strategies
0 references
Newton-type methods
0 references
Lanczos method
0 references
disk packing problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.89633274
0 references
0.8932444
0 references
0.8929505
0 references
0.8886375
0 references
0 references
0.8830195
0 references
0.88224995
0 references
0.8786623
0 references
