A convex relaxation to compute the nearest structured rank deficient matrix (Q4994436)
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 7360853
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A convex relaxation to compute the nearest structured rank deficient matrix |
scientific article; zbMATH DE number 7360853 |
Statements
A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix (English)
0 references
18 June 2021
0 references
convex relaxation
0 references
low rank approximation
0 references
semidefinite programming
0 references
total least squares
0 references
affine structure
0 references
0 references
0 references
0 references
0 references
0.7552335262298584
0 references
0.7510106563568115
0 references
0.7413614988327026
0 references
0.7389450669288635
0 references
0.7335593700408936
0 references
