The convex algebraic geometry of linear inverse problems
Name
Parrilo_The convex algebraic.pdf
Size
316.67 KB
Format
Adobe PDF
Checksum (MD5)
12d73c3ec9d0abbeefabe9f105914894
Author(s)
Chandrasekaran, Venkat
Recht, Benjamin
Parrilo, Pablo A.
Willsky, Alan S.
Date Issued
September 2010
Journal
Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2010
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Chandrasekaran, Venkat et al. “The Convex Algebraic Geometry of Linear Inverse Problems.” 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2010. 699–703. © Copyright 2010 IEEE
Version
Final published version
Abstract
We study a class of ill-posed linear inverse problems in which the underlying model of interest has simple algebraic structure. We consider the setting in which we have access to a limited number of linear measurements of the underlying model, and we propose a general framework based on convex optimization in order to recover this model. This formulation generalizes previous methods based on ℓ[subscript 1]-norm minimization and nuclear norm minimization for recovering sparse vectors and low-rank matrices from a small number of linear measurements. For example some problems to which our framework is applicable include (1) recovering an orthogonal matrix from limited linear measurements, (2) recovering a measure given random linear combinations of its moments, and (3) recovering a low-rank tensor from limited linear observations.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ALLERTON.2010.5706975
