A Discrete-Time Neurodynamic Approach to Sparsity-Constrained Nonnegative Matrix Factorization
From MaRDI portal
Publication:5131157
DOI10.1162/neco_a_01294zbMath1452.65080OpenAlexW3034010340WikidataQ96293564 ScholiaQ96293564MaRDI QIDQ5131157
Jun Wang, Xin-Qi Li, Sam Kwong
Publication date: 2 November 2020
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_01294
Related Items (2)
Sparse signal reconstruction via collaborative neurodynamic optimization ⋮ Boolean matrix factorization based on collaborative neurodynamic optimization with Boltzmann machines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- A recurrent neural network for solving a class of generalized convex optimization problems
- A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations
- A nonnegative matrix factorization algorithm based on a discrete-time projection neural network
- A collaborative neurodynamic approach to global and combinatorial optimization
- A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
- A Novel Recurrent Neural Network with Finite-Time Convergence for Linear Programming
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization
- Equivalence in nonlinear programming
- 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
This page was built for publication: A Discrete-Time Neurodynamic Approach to Sparsity-Constrained Nonnegative Matrix Factorization
