Minimization of a particular singular value

Abstract

We consider the problem of minimizing a particular singular value of a matrix variable, which is then subject to some convex constraints. Convex heuristics for this problem are discussed, including some counter-intuitive results regarding which is best, which then provide upper bounds on the value of the problem. The use of polynomial optimization… (More)
DOI: 10.1109/ALLERTON.2016.7852340

2 Figures and Tables

Topics

  • Presentations referencing similar topics