Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems
From MaRDI portal
Publication:2112682
DOI10.1016/j.cam.2022.114948zbMath1503.65131OpenAlexW4308808599MaRDI QIDQ2112682
Deren Han, Chunfeng Cui, Zehui Liu, Qing-song Wang
Publication date: 11 January 2023
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2022.114948
random permutationstochastic gradient descentinertialnonconvex and nonsmoothtensor CANDECOMP/PARAFAC (CP) decomposition
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Vector and tensor algebra, theory of invariants (15A72)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- On the non-existence of optimal solutions and the occurrence of ``degeneracy in the CANDECOMP/PARAFAC model
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Some convergence results on the regularized alternating least-squares method for tensor decomposition
- A survey on some recent developments of alternating direction method of multipliers
- Inertial stochastic PALM and applications in machine learning
- First-order and stochastic optimization methods for machine learning
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Randomized Alternating Least Squares for Canonical Tensor Decompositions: Application to A PDE With Random Data
- Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
- Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Variational Analysis
- New ALS Methods With Extrapolating Search Directions and Optimal Step Size for Complex-Valued Tensor Decompositions
- Optimization Methods for Large-Scale Machine Learning
- A Practical Randomized CP Tensor Decomposition
- Accelerated Optimization for Machine Learning
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
- Stochastic Gradients for Large-Scale Tensor Decomposition
- Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorization
- On the Efficiency of Random Permutation for ADMM and Coordinate Descent
- Generalized Canonical Polyadic Tensor Decomposition
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Some methods of speeding up the convergence of iteration methods
