Riemannian conjugate gradient method for low-rank tensor completion
From MaRDI portal
(Redirected from Publication:6132849)
convergence analysislow-rank tensor completiontensor singular value decompositionRiemannian conjugate gradient descent method
Convex programming (90C25) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83) Differential geometric aspects in vector and tensor analysis (53A45) Numerical methods for variational inequalities and related problems (65K15) Real-valued functions on manifolds (58C05)
Recommendations
- Low-rank tensor completion by Riemannian optimization
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
- New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition
- A Riemannian trust-region method for low-rank tensor completion.
- Riemannian optimization for high-dimensional tensor completion
Cites work
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Riemannian trust-region method for low-rank tensor completion.
- A new, globally convergent Riemannian conjugate gradient method
- A non-convex tensor rank approximation for tensor completion
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- Alternating direction method with Gaussian back substitution for separable convex programming
- An order-\(p\) tensor factorization with applications in imaging
- Exact Tensor Completion Using t-SVD
- Factorization strategies for third-order tensors
- Function minimization by conjugate gradients
- Low-rank matrix completion by Riemannian optimization
- Low-rank tensor completion based on log-det rank approximation and matrix factorization
- Low-rank tensor completion by Riemannian optimization
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- Optimization methods on Riemannian manifolds and their application to shape space
- Parallel matrix factorization for low-rank tensor completion
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
- Riemannian optimization for high-dimensional tensor completion
- Robust Schatten-p norm based approach for tensor completion
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Tensor Decompositions and Applications
- Tensor Factorization for Low-Rank Tensor Completion
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor completion using total variation and low-rank matrix factorization
- Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data
- Tensor-tensor products with invertible linear transforms
- The geometry of algorithms using hierarchical tensors
- Third-order tensors as linear operators on a space of matrices
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
Cited in
(13)- Guarantees of Riemannian optimization for low rank matrix completion
- Nonlinear conjugate gradient method for vector optimization on Riemannian manifolds with retraction and vector transport
- Riemannian accelerated spectral conjugate gradient method for the tensor completion arising in the color image restoration
- Low-rank tensor completion by Riemannian optimization
- Riemannian optimization for high-dimensional tensor completion
- An improved Riemannian conjugate gradient method and its application to robust matrix completion
- Tensor completion using geodesics on Segre manifolds
- Riemannian preconditioned algorithms for tensor completion via tensor ring decomposition
- New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition
- Riemannian preconditioning algorithms for the low-rank tensor completion via the triple decomposition
- Low-rank matrix completion by Riemannian optimization
- A Riemannian trust-region method for low-rank tensor completion.
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
This page was built for publication: Riemannian conjugate gradient method for low-rank tensor completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132849)
