Quartic First-Order Methods for Low-Rank Minimization

Abstract

We study a generalized nonconvex Burer-Monteiro formulation for low-rank minimization problems. We use recent results on non-Euclidean first order methods to provide efficient and scalable algorithms. Our approach uses geometries induced by quartic kernels on matrix spaces; for unconstrained cases we introduce a novel family of Gram kernels that considerably improves numerical performances. Numerical experiments for Euclidean distance matrix completion and symmetric nonnegative matrix factorization show that our algorithms scale well and reach state of the art performance when compared to specialized methods.

To appear in Journal of Optimization Theory and Applications

References in corpus (1)

• Low-rank optimization for distance matrix completion

Cited by in corpus (5)

• Optimal Complexity and Certification of Bregman First-Order Methods
• Finding stationary points on bounded-rank matrices: A geometric hurdle and a smooth remedy
• Approximate Bregman Proximal Gradient Algorithm for Relatively Smooth Nonconvex Optimization
• Majorization-minimization Bregman proximal gradient algorithms for NMF with the Kullback--Leibler divergence
• A mirror inertial forward-reflected-backward splitting: Global convergence and linesearch extension beyond convexity and Lipschitz smoothness