Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 2009 | Submitted + Published
Book Section - Chapter Open

Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization


Given a fixed matrix, the problem of column subset selection requests a column submatrix that has favorable spectral properties. Most research from the algorithms and numerical linear algebra communities focuses on a variant called rank-revealing QR, which seeks a well-conditioned collection of columns that spans the (numerical) range of the matrix. The functional analysis literature contains another strand of work on column selection whose algorithmic implications have not been explored. In particular, a celebrated result of Bourgain and Tzafriri demonstrates that each matrix with normalized columns contains a large column submatrix that is exceptionally well conditioned. Unfortunately, standard proofs of this result cannot be regarded as algorithmic. This paper presents a randomized, polynomial-time algorithm that produces the submatrix promised by Bourgain and Tzafriri. The method involves random sampling of columns, followed by a matrix factorization that exposes the well-conditioned subset of columns. This factorization, which is due to Grothendieck, is regarded as a central tool in modern functional analysis. The primary novelty in this work is an algorithm, based on eigenvalue minimization, for constructing the Grothendieck factorization. These ideas also result in an approximation algorithm for the (∞, 1) norm of a matrix, which is generally NP-hard to compute exactly. As an added bonus, this work reveals a surprising connection between matrix factorization and the famous maxcut semidefinite program.

Additional Information

© 2009 SIAM. Received 26 June 2008. Revised 2 October 2008. The author thanks Ben Recht for valuable discussions about eigenvalue minimization. Supported in part by ONR award no. N00014-08-1-0883.

Attached Files

Submitted - 0806.4404

Published - Tropp2009p11408Proceedings_Of_The_Twentieth_Annual_Acm-Siam_Symposium_On_Discrete_Algorithms.pdf


Files (569.4 kB)
Name Size Download all
307.4 kB Preview Download
262.0 kB Download

Additional details

August 20, 2023
August 20, 2023