Nonlinearly Preconditioned Optimization on Grassmann Manifolds for Computing Approximate Tucker Tensor Decompositions

DOI10.1137/15M1037288zbMath1382.65183MaRDI QIDQ2800432

Alexander J. M. Howse, Hans De Sterck

Publication date: 15 April 2016

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

zbMATH Keywords

nonlinear optimizationGMRESnonlinear conjugate gradient methodnonlinear preconditioningTucker tensor decomposition

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Iterative numerical methods for linear systems (65F10) Multilinear algebra, tensor calculus (15A69) Local Riemannian geometry (53B20) Preconditioners for iterative methods (65F08)

Related Items (6)

Riemannian Modified Polak--Ribière--Polyak Conjugate Gradient Order Reduced Model by Tensor Techniques ⋮ Parallel reservoir simulators for fully implicit complementarity formulation of multicomponent compressible flows ⋮ Cayley-transform-based gradient and conjugate gradient algorithms on Grassmann manifolds ⋮ On the Asymptotic Linear Convergence Speed of Anderson Acceleration, Nesterov Acceleration, and Nonlinear GMRES ⋮ On the asymptotic linear convergence speed of Anderson acceleration applied to ADMM ⋮ Analytic bundle structure on the idempotent manifold

Uses Software

• TensorToolbox
• Poblano
• Algorithm 862
• Manopt
• MNIST
• Anderson

Cites Work

• Tensor Decompositions and Applications
• An analysis for the DIIS acceleration method used in quantum chemistry calculations
• Handwritten digit classification using higher order singular value decomposition
• Differential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensors
• On the efficient solution of nonlinear finite element equations. I
• Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
• Krylov subspace acceleration for nonlinear multigrid schemes
• Trust-region methods on Riemannian manifolds
• An introduction to hierarchical (\(\mathcal H\)-) rank and TT-rank of tensors with examples
• Riemannian Trust Regions with Finite-Difference Hessian Approximations are Globally Convergent
• Composing Scalable Nonlinear Algebraic Solvers
• A New Truncation Strategy for the Higher-Order Singular Value Decomposition
• A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
• Steepest descent preconditioning for nonlinear GMRES optimization
• Manopt, a Matlab toolbox for optimization on manifolds
• A real time procedure for affinely dependent parametric model order reduction using interpolation on Grassmann manifolds
• Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
• Two classes of multisecant methods for nonlinear acceleration
• Anderson Acceleration for Fixed-Point Iterations
• Tensor Spaces and Numerical Tensor Calculus
• A nonlinearly preconditioned conjugate gradient algorithm for rank‐R canonical tensor approximation
• Algorithm 862
• A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• The Geometry of Algorithms with Orthogonality Constraints
• Line search algorithms with guaranteed sufficient decrease
• A Multilinear Singular Value Decomposition
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A projection method to solve linear systems in tensor format
• Iterative Procedures for Nonlinear Integral Equations
• Methods of conjugate gradients for solving linear systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonlinearly Preconditioned Optimization on Grassmann Manifolds for Computing Approximate Tucker Tensor Decompositions