Details

Autor(en) / Beteiligte

• Mishra, B.
• Meyer, G.
• Bach, F.
• Sepulchre, R.

Titel

Low-Rank Optimization with Trace Norm Penalty

Ist Teil von

• SIAM journal on optimization, 2013-01, Vol.23 (4), p.2124-2149

Ort / Verlag

Philadelphia: Society for Industrial and Applied Mathematics

Erscheinungsjahr

2013

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is characterized by an efficient factorization that makes the trace norm differentiable in the search space and the computation of duality gap numerically tractable. The search space is nonlinear but is equipped with a Riemannian structure that leads to efficient computations. We present a second-order trust-region algorithm with a guaranteed quadratic rate of convergence. Overall, the proposed optimization scheme converges superlinearly to the global solution while maintaining complexity that is linear in the number of rows and columns of the matrix. To compute a set of solutions efficiently for a grid of regularization parameters we propose a predictor-corrector approach that outperforms the naive warm-restart approach on the fixed-rank quotient manifold. The performance of the proposed algorithm is illustrated on problems of low-rank matrix completion and multivariate linear regression. [PUBLICATION ABSTRACT]