A symmetric rank-one quasi-Newton method for nonnegative matrix factorization

DOI10.1155/2014/846483MaRDI QIDQ469969zbMATH OpenOpenAlexWikidataFDO

Authors Shu-Zhen Lai, Hou-Biao Li, Zu-Tao Zhang

Publication date 11 November 2014

Published in ISRN Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://arxiv.org/abs/1305.5829

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Abstract: As we all known, the nonnegative matrix factorization (NMF) is a dimension reduction method that has been widely used in image processing, text compressing and signal processing etc. In this paper, an algorithm for nonnegative matrix approximation is proposed. This method mainly bases on the active set and the quasi-Newton type algorithm, by using the symmetric rank-one and negative curvature direction technologies to approximate the Hessian matrix. Our method improves the recent results of those methods in [Pattern Recognition, 45(2012)3557-3565; SIAM J. Sci. Comput., 33(6)(2011)3261-3281; Neural Computation, 19(10)(2007)2756-2779, etc.]. Moreover, the object function decreases faster than many other NMF methods. In addition, some numerical experiments are presented in the synthetic data, imaging processing and text clustering. By comparing with the other six nonnegative matrix approximation methods, our experiments confirm to our analysis.

Recommendations

• Image processing using Newton-based algorithm of nonnegative matrix factorization
• Fast nonnegative matrix factorization: an active-set-like method and comparisons
• Adaptive computation of the symmetric nonnegative matrix factorization (SymNMF)
• Efficient nonnegative matrix factorization via projected Newton method
• scientific article; zbMATH DE number 7404610

Cites work

• A symmetric rank-one quasi-Newton line-search method using negative curvature directions
• Algorithms and applications for approximate nonnegative matrix factorization
• Efficient nonnegative matrix factorization via projected Newton method
• Fast nonnegative matrix factorization: an active-set-like method and comparisons
• Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Learning the parts of objects by non-negative matrix factorization
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Projected Newton Methods for Optimization Problems with Simple Constraints

Cited in

(10)

• Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing
• scientific article; zbMATH DE number 7404610 (Why is no real title available?)
• Iterative algorithm for the Q-weighted nonnegative matrix factorization
• Non-negative low-rank approximations for multi-dimensional arrays on statistical manifold
• Computing symmetric nonnegative rank factorizations
• Efficient method for symmetric nonnegative matrix factorization with an approximate augmented Lagrangian scheme
• Image processing using Newton-based algorithm of nonnegative matrix factorization
• On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
• Adaptive computation of the symmetric nonnegative matrix factorization (SymNMF)
• Off-diagonal symmetric nonnegative matrix factorization

This page was built for publication: A symmetric rank-one quasi-Newton method for nonnegative matrix factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q469969)