Fazel, M. and Hindi, H. and Boyd, S. (2004) Rank minimization and applications in system theory. In: Proceedings of the 2004 American Control Conference. Vol.4. IEEE , Piscataway, NJ, pp. 3273-3278. ISBN 0-7803-8335-4. https://resolver.caltech.edu/CaltechAUTHORS:20170518-112026555
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png) |
PDF
- Published Version
See Usage Policy. 455kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170518-112026555
Abstract
In this tutorial paper, we consider the problem of minimizing the rank of a matrix over a convex set. The rank minimization problem (RMP) arises in diverse areas such as control, system identification, statistics and signal processing, and is known to be computationally NP-hard. We give an overview of the problem, its interpretations, applications, and solution methods. In particular, we focus on how convex optimization can be used to develop heuristic methods for this problem.
| Item Type: | Book Section | ||||||
|---|---|---|---|---|---|---|---|
| Related URLs: |
| ||||||
| Additional Information: | © 2004 IEEE. | ||||||
| Record Number: | CaltechAUTHORS:20170518-112026555 | ||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20170518-112026555 | ||||||
| Official Citation: | M. Fazel, H. Hindi and S. Boyd, "Rank minimization and applications in system theory," Proceedings of the 2004 American Control Conference, Boston, MA, USA, 2004, pp. 3273-3278 vol.4. | ||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||
| ID Code: | 77572 | ||||||
| Collection: | CaltechAUTHORS | ||||||
| Deposited By: | INVALID USER | ||||||
| Deposited On: | 18 May 2017 18:43 | ||||||
| Last Modified: | 03 Oct 2019 17:59 |
Repository Staff Only: item control page
