Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem (Q343664)
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 6657050
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem |
scientific article; zbMATH DE number 6657050 |
Statements
Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem (English)
0 references
28 November 2016
0 references
non-monotone algorithm
0 references
arbitrary domains
0 references
trust-region method
0 references
large-scale orthogonal procrustes problem
0 references
regularization
0 references
global convergence
0 references
numerical experiments
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8743013143539429
0 references
0.7857324481010437
0 references
0.783755898475647
0 references
0.7499158978462219
0 references
