A symmetric rank-one quasi-Newton method for nonnegative matrix factorization
From MaRDI portal
Publication:469969
DOI10.1155/2014/846483zbMath1298.65101arXiv1305.5829OpenAlexW1963795260WikidataQ59048704 ScholiaQ59048704MaRDI QIDQ469969
Zu-Tao Zhang, Hou-Biao Li, Shu-Zhen Lai
Publication date: 11 November 2014
Published in: ISRN Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.5829
Related Items (2)
Non-negative low-rank approximations for multi-dimensional arrays on statistical manifold ⋮ Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient nonnegative matrix factorization via projected Newton method
- Algorithms and applications for approximate nonnegative matrix factorization
- A symmetric rank-one quasi-Newton line-search method using negative curvature directions
- Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
- Learning the parts of objects by non-negative matrix factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization
This page was built for publication: A symmetric rank-one quasi-Newton method for nonnegative matrix factorization
