Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors

DOI10.1137/090763172zbMath1226.65058arXiv0907.2214OpenAlexW1964650132MaRDI QIDQ5200254

Publication date: 1 August 2011

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0907.2214

zbMATH Keywords

tensor approximations Grassmann manifold Grassmannian symmetric tensor multilinear rank Broyden-Fletcher-Shanno-Goldfarb (BFGS)Grassmann BFGS Grassmann limited memory BFGS Grassmann quasi-Newton product of Grassmannians symmetric multilinear rank

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Differential geometric aspects in vector and tensor analysis (53A45) Grassmannians, Schubert varieties, flag manifolds (14M15) Multilinear algebra, tensor calculus (15A69)

Related Items

The use of the multi-cumulant tensor analysis for the algorithmic optimisation of investment portfolios ⋮ Further results for $Z$-eigenvalue localization theorem for higher-order tensors and their applications ⋮ Efficient alternating least squares algorithms for low multilinear rank approximation of tensors ⋮ Tensor decomposition for learning Gaussian mixtures from moments ⋮ Randomized algorithms for the approximations of Tucker and the tensor train decompositions ⋮ A Riemannian BFGS Method for Nonconvex Optimization Problems ⋮ Simultaneous component analysis by means of Tucker3 ⋮ Optimization on flag manifolds ⋮ Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method ⋮ Topology of tensor ranks ⋮ A Broyden Class of Quasi-Newton Methods for Riemannian Optimization ⋮ Transportless conjugate gradient for optimization on Stiefel manifold ⋮ Krylov-type methods for tensor computations.I ⋮ Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation ⋮ Randomized algorithms for the computation of multilinear rank-$(\mu_1,\mu_2,\mu_3)$ approximations ⋮ The approximate determinantal assignment problem ⋮ Minimality of tensors of fixed multilinear rank ⋮ Variational calculus with sums of elementary tensors of fixed rank ⋮ Riemannian Modified Polak--Ribière--Polyak Conjugate Gradient Order Reduced Model by Tensor Techniques ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ Joint high-order simulation of spatially correlated variables using high-order spatial statistics ⋮ A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints ⋮ A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds ⋮ A Riemannian BFGS Method Without Differentiated Retraction for Nonconvex Optimization Problems ⋮ On global convergence of alternating least squares for tensor approximation ⋮ A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem ⋮ Randomized algorithms for the low multilinear rank approximations of tensors ⋮ A Riemannian nonmonotone spectral method for self-adjoint tangent vector field ⋮ The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence ⋮ Greedy low-rank approximation in Tucker format of solutions of tensor linear systems ⋮ On polynomial time methods for exact low-rank tensor completion ⋮ On the convergence of higher-order orthogonal iteration ⋮ Nonlinearly Preconditioned Optimization on Grassmann Manifolds for Computing Approximate Tucker Tensor Decompositions ⋮ Random Projections for Low Multilinear Rank Tensors ⋮ Symmetric tensor decomposition by an iterative eigendecomposition algorithm ⋮ Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold ⋮ An efficient randomized algorithm for computing the approximate Tucker decomposition ⋮ A framework of constraint preserving update schemes for optimization on Stiefel manifold ⋮ On best rank-2 and rank-(2,2,2) approximations of order-3 tensors ⋮ Tensor neural network models for tensor singular value decompositions ⋮ Riemannian Newton optimization methods for the symmetric tensor approximation problem ⋮ A Krylov-Schur-like method for computing the best rank-$(r_1,r_2,r_3)$ approximation of large and sparse tensors ⋮ Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank- $(L_{r,n},L_{r,n},1)$ Terms---Part II: Algorithms ⋮ A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors ⋮ Unnamed Item ⋮ A literature survey of low-rank tensor approximation techniques ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching

Uses Software