ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2001.04321
  4. Cited By
Accelerating Block Coordinate Descent for Nonnegative Tensor
  Factorization
v1v2 (latest)

Accelerating Block Coordinate Descent for Nonnegative Tensor Factorization

Numerical Linear Algebra with Applications (NLAA), 2020
13 January 2020
A. Ang
Jérémy E. Cohen
Nicolas Gillis
L. Hien
ArXiv (abs)PDFHTML

Papers citing "Accelerating Block Coordinate Descent for Nonnegative Tensor Factorization"

4 / 4 papers shown
Bounded Simplex-Structured Matrix Factorization: Algorithms,
  Identifiability and Applications
Bounded Simplex-Structured Matrix Factorization: Algorithms, Identifiability and ApplicationsIEEE Transactions on Signal Processing (IEEE Trans. Signal Process.), 2022
Olivier Vu Thanh
Nicolas Gillis
Fabian Lecron
360
7
0
26 Sep 2022
Representation Theorem for Matrix Product States
Representation Theorem for Matrix Product StatesSIAM Journal on Mathematics of Data Science (SIMODS), 2021
Erdong Guo
D. Draper
210
2
0
15 Mar 2021
Tangent Space Based Alternating Projections for Nonnegative Low Rank
  Matrix Approximation
Tangent Space Based Alternating Projections for Nonnegative Low Rank Matrix ApproximationIEEE Transactions on Knowledge and Data Engineering (TKDE), 2020
Guang-Jing Song
Michael K. Ng
Tai-Xiang Jiang
215
7
0
02 Sep 2020
Computing Large-Scale Matrix and Tensor Decomposition with Structured
  Factors: A Unified Nonconvex Optimization Perspective
Computing Large-Scale Matrix and Tensor Decomposition with Structured Factors: A Unified Nonconvex Optimization Perspective
Xiao Fu
Nico Vervliet
L. De Lathauwer
Kejun Huang
Nicolas Gillis
CML
196
26
0
15 Jun 2020
1
Page 1 of 1