Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization

DOI10.1109/TSP.2016.2591510zbMath1414.94636arXiv1509.01404MaRDI QIDQ4621012

Arnaud Vandaele, Inderjit S. Dhillon, Qi Lei, Nicolas Gillis, Kai Zhong

Publication date: 8 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.01404

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (6)

Off-diagonal symmetric nonnegative matrix factorization ⋮ A collaborative neurodynamic approach to global and combinatorial optimization ⋮ Quartic first-order methods for low-rank minimization ⋮ Algorithms for positive semidefinite factorization ⋮ Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation ⋮ CoordinateWise Descent Methods for Leading Eigenvalue Problem

This page was built for publication: Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization