• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization (2007)

Cached

  • Download as a PDF

Download Links

  • [www.yaroslavvb.com]
  • [www.ist.caltech.edu]
  • [www.cs.wisc.edu]
  • [www.cs.wisc.edu]
  • [pages.cs.wisc.edu]
  • [pages.cs.wisc.edu]
  • [pages.cs.wisc.edu]
  • [faculty.washington.edu]
  • [faculty.washington.edu]
  • [www.mit.edu]
  • [www.mit.edu]
  • [arxiv.org]
  • [iweb.tntech.edu]
  • [arxiv.org]
  • [faculty.washington.edu]
  • [www.optimization-online.org]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Benjamin Recht , Maryam Fazel , Pablo A Parrilo
Citations:562 - 20 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Recht07guaranteedminimum-rank,
    author = {Benjamin Recht and Maryam Fazel and Pablo A Parrilo},
    title = {Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization },
    year = {2007}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the general affine rank minimization problem is NP-hard, because it contains vector cardinality minimization as a special case. In this paper, we show that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum rank solution can be recovered by solving a convex optimization problem, namely the minimization of the nuclear norm over the given affine space. We present several random ensembles of equations where the restricted isometry property holds with overwhelming probability, provided the codimension of the subspace is Ω(r(m + n) log mn), where m, n are the dimensions of the matrix, and r is its rank. The techniques used in our analysis have strong parallels in the compressed sensing framework. We discuss how affine rank minimization generalizes this pre-existing concept and outline a dictionary relating concepts from cardinality minimization to those of rank minimization. We also discuss several algorithmic approaches to solving the norm minimization relaxations, and illustrate our results with numerical examples.

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University