Subset selection for matrices

We consider the question of how to delete m − k rows from a matrix X ∈ Rm×n so that the resulting matrix A ∈ Rk×n is as non-singular as possible. Bounds for the singular values of A are derived which decrease only algebraically with m and n. In addition a number of applications, where subset selection is necessary, are examined.