Imbalanced low-rank tensor completion via latent matrix factorization
- 6 September 2022
- journal article
- research article
- Published by Elsevier in Neural Networks
- Vol. 155, 369-382
Abstract
No abstract availableKeywords
Funding Information
- Japan Society for the Promotion of Science (20H04249)
- National Natural Science Foundation of China (61973090, 62006045, 62071132, 62073087)
- Special Project for Research and Development in Key areas of Guangdong Province (2019B010154002)
This publication has 33 references indexed in Scilit:
- Nonnegative Matrix and Tensor Factorizations : An algorithmic perspectiveIEEE Signal Processing Magazine, 2014
- Sparse Subspace Clustering: Algorithm, Theory, and ApplicationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2013
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz InequalityMathematics of Operations Research, 2010
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm MinimizationSIAM Review, 2010
- Tensor Decompositions and ApplicationsSIAM Review, 2009
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical SystemsSIAM Journal on Optimization, 2007
- Clarke Subgradients of Stratifiable FunctionsSIAM Journal on Optimization, 2007
- Image quality assessment: from error visibility to structural similarityIEEE Transactions on Image Processing, 2004
- Tensor rank is NP-completeJournal of Algorithms, 1990