A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem (Q5376452)

scientific article; zbMATH DE number 6938326

Language	Label	Description	Also known as
English	A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem	scientific article; zbMATH DE number 6938326

Statements

instance of

scholarly article

0 references

title

A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem (English)

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

18 September 2018

0 references

full work available at URL

https://arxiv.org/abs/1709.00033

0 references

zbMATH Keywords

canonical polyadic decomposition

0 references

Riemannian optimization

0 references

trust region method

0 references

Gauss-Newton method

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Q5433140

0 references

Newton's method on Riemannian manifolds and a geometric model for the human spine

0 references

Identifiability of parameters in latent structure models with many observed variables

0 references

Tensor decompositions for learning latent variable models

0 references

Q4210476

0 references

The Condition Number of Join Decompositions

0 references

Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number

0 references

Condition

0 references

Generalizing the column-row matrix decomposition to multi-way arrays

0 references

Analysis of individual differences in multidimensional scaling via an $n$-way generalization of ``Eckart-Young'' decomposition

0 references

Maximum Block Improvement and Polynomial Optimization

0 references

New ALS Methods With Extrapolating Search Directions and Optimal Step Size for Complex-Valued Tensor Decompositions

0 references

An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors

0 references

Effective Criteria for Specific Identifiability of Tensors and Forms

0 references

Optimization on the hierarchical Tucker manifold - applications to tensor completion

0 references

A Multilinear Singular Value Decomposition

0 references

Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem

0 references

A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition

0 references

An Adaptive Algebraic Multigrid Algorithm for Low-Rank Canonical Tensor Decomposition

0 references

Newton's method for analytic systems of equations with constant rank derivatives

0 references

Q4348513

0 references

A randomized algorithm for a tensor-based generalization of the singular value decomposition

0 references

Algebraic geometry of Bayesian networks

0 references

Q5689624

0 references

Tensor Spaces and Numerical Tensor Calculus

0 references

Q4002797

0 references

Q4864704

0 references

On manifolds of tensors of fixed TT-rank

0 references

Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme

0 references

Tensor Decompositions and Applications

0 references

Low-rank tensor completion by Riemannian optimization

0 references

Q3096060

0 references

Introduction to Smooth Manifolds

0 references

On Convergence of the Maximum Block Improvement Method

0 references

Cubic regularization of Newton method and its global performance

0 references

Q5491447

0 references

Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time

0 references

Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC

0 references

Semialgebraic Geometry of Nonnegative Tensor Rank

0 references

Enhanced Line Search: A Novel Method to Accelerate PARAFAC

0 references

HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation

0 references

Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors

0 references

Tensor Decomposition for Signal Processing and Machine Learning

0 references

Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization

0 references

Riemannian Optimization for High-Dimensional Tensor Completion

0 references

Q3998482

0 references

A comparison of algorithms for fitting the PARAFAC model

0 references

The geometry of algorithms using hierarchical tensors

0 references

Condition numbers for the tensor rank decomposition

0 references

Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking

0 references

A New Truncation Strategy for the Higher-Order Singular Value Decomposition

0 references

Identifiers

zbMATH Open document ID

1397.15022

0 references

DOI

10.1137/17M114618X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5376452