Nonnegative matrix factorization with constrained second-order optimization

DOI10.1016/j.sigpro.2007.01.024zbMath1186.94391OpenAlexW2023062008WikidataQ60486888 ScholiaQ60486888MaRDI QIDQ970931

Rafal Zdunek, Andrzej Cichocki

Publication date: 19 May 2010

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2007.01.024

zbMATH Keywords

blind source separationquasi-Newton methodnonnegative matrix factorizationfixed-point algorithmGPCGsecond-order optimization

Mathematics Subject Classification ID

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

Related Items (8)

Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations ⋮ Bi-level algorithm for optimizing hyperparameters in penalized nonnegative matrix factorization ⋮ Application of regularized alternating least squares to an astrophysical problem ⋮ SVD based initialization: A head start for nonnegative matrix factorization ⋮ Projected gradient method for kernel discriminant nonnegative matrix factorization and the applications ⋮ Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization ⋮ Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing ⋮ Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis

This page was built for publication: Nonnegative matrix factorization with constrained second-order optimization