Optimal Condition Numbers in Low-Rank Positive Semidefinite Matrix Sensing (Q7285012)
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:
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Condition Numbers in Low-Rank Positive Semidefinite Matrix Sensing |
No description defined |
Statements
Optimal Condition Numbers in Low-Rank Positive Semidefinite Matrix Sensing (English)
0 references
23 August 2026
0 references
cs.IT
0 references
math.FA
0 references
math.NA
0 references
Mingxuan Sun
0 references
Zhiqiang Xu
0 references
We provide deterministic universal bounds on the global condition numbers of positive semidefinite matrix sensing maps and show that random rank-one Gaussian measurements achieve these lower limits asymptotically, hence being optimal in terms of stability guarantees for related low-rank matrix recovery methods.
0 references
Low-Rank Matrix
0 references
Positive Semidefinite
0 references
Condition Numbers
0 references
Optimal Sampling
0 references
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
