The convex algebraic geometry of linear inverse problems
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 optim...
Main Authors: | Chandrasekaran, Venkat (Contributor), Recht, Benjamin (Author), Parrilo, Pablo A. (Contributor), Willsky, Alan S. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2012-09-14T15:56:55Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Convex Graph Invariants
by: Chandrasekaran, Venkat, et al.
Published: (2012) -
Latent Variable Graphical Model Selection Via Convex Optimization
by: Chandrasekaran, Venkat, et al.
Published: (2012) -
Semidefinite Descriptions of the Convex Hull of Rotation Matrices
by: Saunderson, James, et al.
Published: (2016) -
On the equivalence of algebraic conditions for convexity and quasiconvexity of polynomials
by: Ahmadi, Amir Ali, et al.
Published: (2012) -
Dualities in convex algebraic geometry
by: Philipp Rostalski, et al.
Published: (2010-01-01)