A nonnegative matrix factorization algorithm based on a discrete-time projection neural network

DOI10.1016/j.neunet.2018.03.003zbMath1434.68502OpenAlexW2791926423WikidataQ52593921 ScholiaQ52593921MaRDI QIDQ2179837

Hangjun Che, Jun Wang

Publication date: 13 May 2020

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2018.03.003

zbMATH Keywords

nonnegative matrix factorizationbiconvex optimizationdiscrete-time projection neural network

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Factorization of matrices (15A23) Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Related Items (8)

A hybrid impulsive and sampled-data control framework for a class of nonlinear dynamical systems with input constraints ⋮ A collaborative neurodynamic approach to global and combinatorial optimization ⋮ Sparse signal reconstruction via collaborative neurodynamic optimization ⋮ Boolean matrix factorization based on collaborative neurodynamic optimization with Boltzmann machines ⋮ Neurodynamics-driven portfolio optimization with targeted performance criteria ⋮ A proximal neurodynamic model for solving inverse mixed variational inequalities ⋮ Multi-periodicity of switched neural networks with time delays and periodic external inputs under stochastic disturbances ⋮ A Discrete-Time Neurodynamic Approach to Sparsity-Constrained Nonnegative Matrix Factorization

Cites Work

• Unnamed Item
• Unnamed Item
• A one-layer recurrent neural network for constrained nonsmooth invex optimization
• A one-layer recurrent neural network for constrained nonconvex optimization
• Algorithms and applications for approximate nonnegative matrix factorization
• A deterministic annealing neural network for convex programming
• On the stability of globally projected dynamical systems
• A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations
• A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
• A recurrent neural network for adaptive beamforming and array correction
• Biconvex sets and optimization with biconvex functions: a survey and extensions
• A Novel Recurrent Neural Network with Finite-Time Convergence for Linear Programming
• Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
• A Recurrent Neural Network for Nonlinear Convex Optimization Subject to Nonlinear Inequality Constraints
• Learning the parts of objects by non-negative matrix factorization
• A One-Layer Recurrent Neural Network with a Discontinuous Activation Function for Linear Programming
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Independent Component Analysis and Blind Signal Separation

This page was built for publication: A nonnegative matrix factorization algorithm based on a discrete-time projection neural network