A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
From MaRDI portal
Publication:5376452
DOI10.1137/17M114618XzbMath1397.15022arXiv1709.00033WikidataQ115246936 ScholiaQ115246936MaRDI QIDQ5376452
Nick Vannieuwenhoven, Paul Breiding
Publication date: 18 September 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.00033
Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53) Numerical computation of matrix norms, conditioning, scaling (65F35) Semialgebraic sets and related spaces (14P10) Complexity and performance of numerical algorithms (65Y20) Multilinear algebra, tensor calculus (15A69) Local Riemannian geometry (53B20) Methods of local Riemannian geometry (53B21)
Related Items (15)
A Trust-region Method for Nonsmooth Nonconvex Optimization ⋮ Tensor methods for the Boltzmann-BGK equation ⋮ Low-Rank Tucker Approximation of a Tensor from Streaming Data ⋮ Tensor decomposition for learning Gaussian mixtures from moments ⋮ An approximation method of CP rank for third-order tensor completion ⋮ Symmetric Hermitian decomposability criterion, decomposition, and its applications ⋮ The average condition number of most tensor rank decomposition problems is infinite ⋮ Geometric Methods on Low-Rank Matrix and Tensor Manifolds ⋮ Hermitian Tensor Decompositions ⋮ Riemannian Newton optimization methods for the symmetric tensor approximation problem ⋮ The Dynamics of Swamps in the Canonical Tensor Approximation Problem ⋮ Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion ⋮ The Condition Number of Riemannian Approximation Problems ⋮ New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition ⋮ A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- The geometry of algorithms using hierarchical tensors
- Low-rank tensor completion by Riemannian optimization
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- A comparison of algorithms for fitting the PARAFAC model
- Generalizing the column-row matrix decomposition to multi-way arrays
- Identifiability of parameters in latent structure models with many observed variables
- Newton's method for analytic systems of equations with constant rank derivatives
- Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
- Optimization on the hierarchical Tucker manifold - applications to tensor completion
- Condition numbers for the tensor rank decomposition
- On manifolds of tensors of fixed TT-rank
- Algebraic geometry of Bayesian networks
- Cubic regularization of Newton method and its global performance
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation
- Riemannian Optimization for High-Dimensional Tensor Completion
- Semialgebraic Geometry of Nonnegative Tensor Rank
- Condition
- Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
- Introduction to Smooth Manifolds
- Maximum Block Improvement and Polynomial Optimization
- A New Truncation Strategy for the Higher-Order Singular Value Decomposition
- A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
- Tensor decompositions for learning latent variable models
- On Convergence of the Maximum Block Improvement Method
- Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
- Tensor Spaces and Numerical Tensor Calculus
- Newton's method on Riemannian manifolds and a geometric model for the human spine
- A Multilinear Singular Value Decomposition
- New ALS Methods With Extrapolating Search Directions and Optimal Step Size for Complex-Valued Tensor Decompositions
- The Condition Number of Join Decompositions
- Tensor Decomposition for Signal Processing and Machine Learning
- An Adaptive Algebraic Multigrid Algorithm for Low-Rank Canonical Tensor Decomposition
- Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
- An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors
- Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking
- Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Enhanced Line Search: A Novel Method to Accelerate PARAFAC
- Effective Criteria for Specific Identifiability of Tensors and Forms
This page was built for publication: A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
