| dc.contributor |
Massachusetts Institute of Technology. Department of Mathematics |
|
| dc.contributor |
Demanet, Laurent |
|
| dc.creator |
Cosse, Augustin |
|
| dc.creator |
Demanet, Laurent |
|
| dc.date |
2017-06-26T23:18:45Z |
|
| dc.date |
2017-06-26T23:18:45Z |
|
| dc.date |
2016-01 |
|
| dc.date.accessioned |
2023-03-01T18:08:21Z |
|
| dc.date.available |
2023-03-01T18:08:21Z |
|
| dc.identifier |
978-1-4799-1963-5 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/110289 |
|
| dc.identifier |
Cosse, Augustin, and Laurent Demanet. “Rank-One Matrix Completion Is Solved by the Sum-of-Squares Relaxation of Order Two.” 2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP) (December 2015). ©2015 IEEE |
|
| dc.identifier |
https://orcid.org/0000-0001-7052-5097 |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/278895 |
|
| dc.description |
This note studies the problem of nonsymmetric rank-one matrix completion. We show that in every instance where the problem has a unique solution, one can recover the original matrix through the second round of the sum-of-squares/Lasserre hierarchy with minimization of the trace of the moments matrix. Our proof system is based on iteratively building a sum of N - 1 linearly independent squares, where N is the number of monomials of degree at most two, corresponding to the canonical basis (z[superscript α] - z[subscript 0][superscript α])[superscript 2]. Those squares are constructed from the ideal I generated by the constraints and the monomials provided by the minimization of the trace. |
|
| dc.description |
United States. Office of Naval Research |
|
| dc.description |
National Science Foundation (U.S.) |
|
| dc.description |
TOTAL (Firm) |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Institute of Electrical and Electronics Engineers (IEEE) |
|
| dc.relation |
http://dx.doi.org/10.1109/CAMSAP.2015.7383723 |
|
| dc.relation |
2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP) |
|
| dc.rights |
Creative Commons Attribution-Noncommercial-Share Alike |
|
| dc.rights |
http://creativecommons.org/licenses/by-nc-sa/4.0/ |
|
| dc.source |
MIT web domain |
|
| dc.title |
Rank-one matrix completion is solved by the sum-of-squares relaxation of order two |
|
| dc.type |
Article |
|
| dc.type |
http://purl.org/eprint/type/ConferencePaper |
|