Graph sparse nonnegative matrix factorization algorithm based on the inertial projection neural network

DOI10.1155/2018/2743678zbMath1398.65080OpenAlexW2794061978MaRDI QIDQ1791058

Biqun Xiang, Chuandong Li, Xiangguang Dai

Publication date: 4 October 2018

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/2743678

zbMATH Keywords

dimensionality reductionsparse representationgraph structuregraph sparse nonnegative matrix factorizationinertial neural network

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Nonconvex programming, global optimization (90C26) Neural networks for/in biological studies, artificial life and related topics (92B20)

Related Items (1)

Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing

Cites Work

• Unnamed Item
• A one-layer recurrent neural network for constrained nonconvex optimization
• ``Neural computation of decisions in optimization problems
• Principal component analysis.
• A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
• Analysis and design of a recurrent neural network for linear programming
• A projection neural network and its application to constrained optimization problems
• Learning the parts of objects by non-negative matrix factorization
• Convergence of a block coordinate descent method for nondifferentiable minimization

This page was built for publication: Graph sparse nonnegative matrix factorization algorithm based on the inertial projection neural network