S-semigoodness for Low-Rank Semidefinite Matrix Recovery
We extend and characterize the concept of s-semigoodness for a sensing matrix in sparse nonnegative recovery (proposed by Juditsky , Karzan and Nemirovski [Math Program, 2011]) to the linear transformations in low-rank semidefinite matrix recovery. We show that ssemigoodnessis not only a necessary a...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Yokohama Publishers
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/8702 |
| _version_ | 1848745735431913472 |
|---|---|
| author | Kong, L. Sun, Jie xiu, N. |
| author_facet | Kong, L. Sun, Jie xiu, N. |
| author_sort | Kong, L. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | We extend and characterize the concept of s-semigoodness for a sensing matrix in sparse nonnegative recovery (proposed by Juditsky , Karzan and Nemirovski [Math Program, 2011]) to the linear transformations in low-rank semidefinite matrix recovery. We show that ssemigoodnessis not only a necessary and sufficient condition for exact s-rank semidefinitematrix recovery by a semidefinite program, but also provides a stable recovery under someconditions. We also show that both s-semigoodness and semiNSP are equivalent. |
| first_indexed | 2025-11-14T06:22:05Z |
| format | Journal Article |
| id | curtin-20.500.11937-8702 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T06:22:05Z |
| publishDate | 2014 |
| publisher | Yokohama Publishers |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-87022017-01-30T11:08:15Z S-semigoodness for Low-Rank Semidefinite Matrix Recovery Kong, L. Sun, Jie xiu, N. s-semigoodness necessary and sufficient - condition exact and stable recovery unitary property low-rank semidefinite matrix recovery We extend and characterize the concept of s-semigoodness for a sensing matrix in sparse nonnegative recovery (proposed by Juditsky , Karzan and Nemirovski [Math Program, 2011]) to the linear transformations in low-rank semidefinite matrix recovery. We show that ssemigoodnessis not only a necessary and sufficient condition for exact s-rank semidefinitematrix recovery by a semidefinite program, but also provides a stable recovery under someconditions. We also show that both s-semigoodness and semiNSP are equivalent. 2014 Journal Article http://hdl.handle.net/20.500.11937/8702 Yokohama Publishers restricted |
| spellingShingle | s-semigoodness necessary and sufficient - condition exact and stable recovery unitary property low-rank semidefinite matrix recovery Kong, L. Sun, Jie xiu, N. S-semigoodness for Low-Rank Semidefinite Matrix Recovery |
| title | S-semigoodness for Low-Rank Semidefinite Matrix Recovery |
| title_full | S-semigoodness for Low-Rank Semidefinite Matrix Recovery |
| title_fullStr | S-semigoodness for Low-Rank Semidefinite Matrix Recovery |
| title_full_unstemmed | S-semigoodness for Low-Rank Semidefinite Matrix Recovery |
| title_short | S-semigoodness for Low-Rank Semidefinite Matrix Recovery |
| title_sort | s-semigoodness for low-rank semidefinite matrix recovery |
| topic | s-semigoodness necessary and sufficient - condition exact and stable recovery unitary property low-rank semidefinite matrix recovery |
| url | http://hdl.handle.net/20.500.11937/8702 |