Low-Rank Optimization with Convex Constraints

Christian Grussler, Anders Rantzer, Pontus Giselsson

Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskriftPeer review


The problem of low-rank approximation with convex constraints, which appears in data analysis, system identification, model order reduction, low-order controller design and low-complexity modelling is considered. Given a matrix, the objective is to find a low-rank approximation that meets rank and convex constraints, while minimizing the distance to the matrix in the squared Frobenius norm. In many situations, this non-convex problem is convexified by nuclear norm regularization. However, we will see that the approximations obtained by this method may be far from optimal. Here, we propose an alternative convex relaxation that uses the convex envelope of the squared Frobenius norm and the rank constraint. With this approach, easily verifiable conditions are obtained under which the solutions to the convex relaxation and the original non-convex problem coincide. An SDP representation of the convex envelope is derived, which allows us to treat several known problems. Our example on optimal low-rank Hankel approximation/model reduction illustrates that the proposed convex relaxation performs consistently better than nuclear norm regularization as well as balanced truncation.

Sidor (från-till)4000-4007
TidskriftIEEE Transactions on Automatic Control
Tidigt onlinedatum2018 mars 7
StatusPublished - 2018

Ämnesklassifikation (UKÄ)

  • Reglerteknik


Utforska forskningsämnen för ”Low-Rank Optimization with Convex Constraints”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här