A Block Coordinate Descent-Based Projected Gradient Algorithm for Orthogonal Non-Negative Matrix Factorization
This article uses the projected gradient method (PG) for a non-negative matrix factorization problem (NMF), where one or both matrix factors must have orthonormal columns or rows. We penalize the orthonormality constraints and apply the PG method via a block coordinate descent approach. This means t...
Main Authors: | Soodabeh Asadi, Janez Povh |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-03-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/5/540 |
Similar Items
-
Differentially private block coordinate descent
by: Shazia Riaz, et al.
Published: (2023-01-01) -
A Continual Learning Algorithm Based on Orthogonal Gradient Descent Beyond Neural Tangent Kernel Regime
by: Da Eun Lee, et al.
Published: (2023-01-01) -
Distributed Sparse Precision Matrix Estimation via Alternating Block-Based Gradient Descent
by: Wei Dong, et al.
Published: (2024-02-01) -
pyGNMF: A Python library for implementation of generalised non-negative matrix factorisation method
by: Nirav L. Lekinwala, et al.
Published: (2022-12-01) -
Membership inference attack on differentially private block coordinate descent
by: Shazia Riaz, et al.
Published: (2023-10-01)