Efficient nonnegative matrix factorization via projected Newton method
From MaRDI portal
Publication:437490
DOI10.1016/j.patcog.2012.02.037zbMath1242.68270OpenAlexW1987423550MaRDI QIDQ437490
Publication date: 17 July 2012
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2012.02.037
nonnegative least squaresnonnegative matrix factorizationlow rankprojected Newton methodquadratic convergence rate
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation ⋮ Quasi non-negative quaternion matrix factorization with application to color face recognition ⋮ Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization ⋮ Efficient Nonnegative Matrix Factorization by DC Programming and DCA ⋮ A symmetric rank-one quasi-Newton method for nonnegative matrix factorization ⋮ Image processing using Newton-based algorithm of nonnegative matrix factorization ⋮ An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices ⋮ Iterative algorithm for the Q-weighted nonnegative matrix factorization ⋮ Numerical method for the generalized nonnegative tensor factorization problem ⋮ Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing ⋮ An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using underapproximations for sparse nonnegative matrix factorization
- Algorithms and applications for approximate nonnegative matrix factorization
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- SVD based initialization: A head start for nonnegative matrix factorization
- Document clustering using nonnegative matrix factorization
- 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: Efficient nonnegative matrix factorization via projected Newton method