Computation of the nonnegative canonical tensor decomposition with two accelerated proximal gradient algorithms

Marouane Nazih, Khalid Minaoui, Elaheh Sobhani, Pierre Comon

Type: Article

Publication Date: 2022-08-03

Citations: 0

DOI: https://doi.org/10.1016/j.dsp.2022.103682

View Publication

Download PDF

Locations

HAL (Le Centre pour la Communication Scientifique Directe) - View - PDF
Digital Signal Processing - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Using the proximal gradient and the accelerated proximal gradient as a canonical polyadic tensor decomposition algorithms in difficult situations	2020	Marouane Nazih Khalid Minaoui Pierre Comon
+ PDF Chat	A Quadratically Convergent Proximal Algorithm For Nonnegative Tensor Decomposition	2020	Nico Vervliet Andreas Themelis Panagiotis Patrinos Lieven De Lathauwer
+ PDF Chat	Monotone and non-monotone accelerated proximal gradient for nonnegative canonical polyadic tensor decomposition	2021	Marouane Nazih Khalid Minaoui Elaheh Sobhani Pierre Comon
+	Alternating proximal gradient method for sparse nonnegative Tucker decomposition	2013	Yangyang Xu
+ PDF Chat	Computation of low-rank tensor approximation under existence constraint via a forward-backward algorithm	2021	Marouane Nazih Khalid Minaoui Elaheh Sobhani Pierre Comon
+ PDF Chat	Alternating proximal gradient method for sparse nonnegative Tucker decomposition	2014	Yangyang Xu
+	Efficient Nonnegative Tensor Decomposition Using Alternating Direction Proximal Method of Multipliers	2024	Deqing Wang Guoqiang Hu
+	Distributed Nonnegative Tensor Canonical Polyadic Decomposition With Automatic Rank Determination	2020	Lei Cheng Xueke Tong Yik‐Chung Wu
+	Weighted Krylov-Levenberg-Marquardt Method for Canonical Polyadic Tensor Decomposition	2020	Petr Tichavský Anh Huy Phan Andrzej Cichocki
+ PDF Chat	Computation of the regularized canonical polyadic decomposition of tensors using the accelerated proximal gradient with momentum	2021	Marouane Nazih Khalid Minaoui Pierre Comon
+ PDF Chat	Joint Factors and Rank Estimation for the Canonical Polyadic Decomposition Based on Convex Optimization	2022	Ouafae Karmouda Jérémie Boulanger Rémy Boyer
+ PDF Chat	Fast Tensor Principal Component Analysis via Proximal Alternating Direction Method with Vectorized Technique	2017	Haiyan Fan Gangyao Kuang Linbo Qiao
+	Doubly Accelerated Proximal Gradient for Nonnegative Tensor Decomposition	2024	Deqing Wang
+	Robust Tensor Tracking With Missing Data and Outliers: Novel Adaptive CP Decomposition and Convergence Analysis	2022	Le Trung Thanh Karim Abed‐Meraim Nguyen Linh-Trung Adel Hafiane
+	An Efficient Algorithm for Tensor Principal Component Analysis via Proximal Linearized Alternating Direction Method of Multipliers	2016	Linbo Qiao Bofeng Zhang Lei Zhuang Jinshu Su
+	An Algebraic Coupled Canonical Polyadic Decomposition Algorithm via Joint Eigenvalue Decomposition	2022	Kai Xi Xiao‐Feng Gong Qiu‐Hua Lin
+	Half-Quadratic Alternating Direction Method of Multipliers for Robust Orthogonal Tensor Approximation	2020	Yuning Yang Yun‐Long Feng
+	Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorization	2019	Xiao Fu Shahana Ibrahim Hoi-To Wai Cheng Gao Kejun Huang
+	Fast Learnings of Coupled Nonnegative Tensor Decomposition Using Optimal Gradient and Low-rank Approximation	2023	Xiulin Wang Tapani Ristaniemi Fengyu Cong
+ PDF Chat	Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorization	2020	Xiao Fu Shahana Ibrahim Hoi-To Wai Cheng Gao Kejun Huang

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (44)

Action	Title	Year	Authors
+	Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation	2009	Andrzej Cichocki Rafał Zdunek Anh Huy Phan Шун-ичи Амари
+	Fixed-Point Algorithms for Inverse Problems in Science and Engineering	2011	Patrick L. Combettes Jean‐Christophe Pesquet
+ PDF Chat	Nonlinear system modeling and identification using Volterra‐PARAFAC models	2011	Gérard Favier Alain Y. Kibangou Thomas Bouilloc
+	Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods	2011	Hédy Attouch Jérôme Bolte B. F. Svaiter
+	A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion	2013	Yangyang Xu Wotao Yin
+	Applications of tensor (multiway array) factorizations and decompositions in data mining	2011	Morten Mørup
+	Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition	1970	J. Douglas Carroll Jih-Jie Chang
+	Higher rank Support Tensor Machines for visual recognition	2012	Irene Kotsia Weiwei Guo Ioannis Patras
+	On Kruskal’s uniqueness condition for the Candecomp/Parafac decomposition	2006	Alwin Stegeman Nicholas D. Sidiropoulos
+	Construction and analysis of degenerate PARAFAC models	2000	Pentti Paatero