Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem
From MaRDI portal
Publication:2114581
DOI10.1007/s10898-021-01074-3zbMath1486.90156arXiv2012.05963OpenAlexW3197493595MaRDI QIDQ2114581
Janez Povh, Timotej Hrga, Gašper Petelin, Vida Vukašinović, Gregor Papa, Nataša Pržulj, Rok Hribar
Publication date: 15 March 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.05963
projected gradient methodfixed point methodblock coordinate descentnon-negative matrix factorizationADAM
Related Items
Uses Software
Cites Work
- Unnamed Item
- Similarity-based pattern recognition. Second international workshop, SIMBAD 2013, York, UK, July 3--5, 2013. Proceedings
- On the computational complexity of membership problems for the completely positive cone and its dual
- A boundary point method to solve semidefinite programs
- A robust real-coded evolutionary algorithm with toroidal search space conversion
- QPLIB: a library of quadratic programming instances
- Stochastic subgradient method converges on tame functions
- Coordinate descent algorithms
- SVD based initialization: A head start for nonnegative matrix factorization
- A convergent algorithm for orthogonal nonnegative matrix factorization
- On the Complexity of Nonnegative Matrix Factorization
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
- A Nonconvex Splitting Method for Symmetric Nonnegative Matrix Factorization: Convergence Analysis and Optimality
- Regularization Methods for Semidefinite Programming
- Learning representations by back-propagating errors
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Convergence of a block coordinate descent method for nondifferentiable minimization
