A feasible filter method for the nearest low-rank correlation matrix problem (Q494667)
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 feasible filter method for the nearest low-rank correlation matrix problem |
scientific article; zbMATH DE number 6477405
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A feasible filter method for the nearest low-rank correlation matrix problem |
scientific article; zbMATH DE number 6477405 |
Statements
A feasible filter method for the nearest low-rank correlation matrix problem (English)
0 references
1 September 2015
0 references
The paper presents a new easily computed constrained-preserving update scheme which can be viewed as a generalization of the Cayley transform, a classical retraction on the Stiefel manifold. A simple filter mechanism for unconstrained optimization is used in the given feasible method to promote global convergence to first-order critical points. Numerical results are given.
0 references
low-rank correlation matrix
0 references
feasible method
0 references
Stiefel manifold
0 references
0 references
0 references
0.8462426066398621
0 references
0.8082090616226196
0 references
0.8034067153930664
0 references
0.7975097298622131
0 references