Geometric Methods on Low-Rank Matrix and Tensor Manifolds

DOI10.1007/978-3-030-31351-7_9OpenAlexW3014181683MaRDI QIDQ3300541FDOQ3300541

Bart Vandereycken, André Uschmajew

Publication date: 29 July 2020

Published in: Handbook of Variational Methods for Nonlinear Geometric Data (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-31351-7_9

Recommendations

• A Geometric Approach to Low-Rank Matrix Completion
• Euclidean Representation of Low-Rank Matrices and Its Geometric Properties
• The geometry of weighted low-rank approximations
• The geometry of matrix eigenvalue methods
• The Global Optimization Geometry of Low-Rank Matrix Optimization
• The non-convex geometry of low-rank matrix optimization
• Geometric multiscale decompositions of dynamic low-rank matrices
• A geometric framework for sparse matrix problems
• Geometric aspects of the theory of Krylov subspace methods
• Structured low-rank approximation: optimization on matrix manifold approach

Mathematics Subject Classification ID

Numerical methods for partial differential equations, boundary value problems (65Nxx) Numerical methods for partial differential equations, initial value and time-dependent initial-boundary value problems (65Mxx) Numerical approximation and computational geometry (primarily algorithms) (65Dxx)

Cites Work

• ARPACK Users' Guide
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tensor Decompositions and Applications
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Title not available (Why is that?)
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Tensor-Train Decomposition
• TT-cross approximation for multidimensional arrays
• Hierarchical Singular Value Decomposition of Tensors
• Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
• Dynamically orthogonal field equations for continuous stochastic dynamical systems
• Computational Methods for Linear Matrix Equations
• Low-rank tensor completion by Riemannian optimization
• Title not available (Why is that?)
• Approximation of Large-Scale Dynamical Systems
• Critical points of matrix least squares distance functions
• Tensor numerical methods in scientific computing
• Tensor Spaces and Numerical Tensor Calculus
• On the Early History of the Singular Value Decomposition
• Low-rank matrix completion by Riemannian optimization
• A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations
• Positive definiteness in the numerical solution of Riccati differential equations
• A literature survey of low-rank tensor approximation techniques
• Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
• An area law for one-dimensional quantum systems
• Alternating Projections on Manifolds
• The Gradient Projection Method Along Geodesics
• Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions
• Learning with tensors: a framework based on convex optimization and spectral regularization
• From quantum to classical molecular dynamics: Reduced models and numerical analysis.
• The density-matrix renormalization group in the age of matrix product states
• A new scheme for the tensor representation
• Quantics-TT collocation approximation of parameter-dependent and stochastic elliptic PDEs
• Approximation of $2^d\times2^d$ Matrices Using Tensor Decomposition
• Tensor-Structured Galerkin Approximation of Parametric and Stochastic Elliptic PDEs
• Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats
• Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
• Low-Rank Explicit QTT Representation of the Laplace Operator and Its Inverse
• \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
• On optimality of approximate low rank solutions of large-scale matrix equations
• Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations
• A projection method to solve linear systems in tensor format
• Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
• SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
• On manifolds of tensors of fixed TT-rank
• Dynamical approximation by hierarchical Tucker and tensor-train tensors
• Dynamical Tensor Approximation
• The geometry of algorithms using hierarchical tensors
• On the approximation of high-dimensional differential equations in the hierarchical Tucker format
• Dynamical Low‐Rank Approximation
• Fixed-rank matrix factorizations and Riemannian low-rank optimization
• Low rank tensor recovery via iterative hard thresholding
• Error Analysis of the Dynamically Orthogonal Approximation of Time Dependent Random PDEs
• A projector-splitting integrator for dynamical low-rank approximation
• Low-rank retractions: a survey and new results
• Adaptive stochastic Galerkin FEM with hierarchical tensor representations
• Low-Rank Tensor Methods with Subspace Correction for Symmetric Eigenvalue Problems
• Time Integration in the Multiconfiguration Time-Dependent Hartree Method of Molecular Quantum Dynamics
• Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
• Time Integration of Tensor Trains
• Tensor Decomposition for Signal Processing and Machine Learning
• Title not available (Why is that?)
• Polynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Format
• Tensor numerical methods in quantum chemistry
• Riemannian optimization for high-dimensional tensor completion
• Hierarchical Tensor Approximation of Output Quantities of Parameter-Dependent PDEs
• A Geometric Approach to Dynamical Model Order Reduction
• Guarantees of Riemannian optimization for low rank matrix recovery
• Global rates of convergence for nonconvex optimization on manifolds
• An adaptive subdivision method for root finding of univariate polynomials
• Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds
• Numerical low-rank approximation of matrix differential equations
• Discretized dynamical low-rank approximation in the presence of small singular values
• Numerical solution of the finite horizon stochastic linear quadratic control problem
• Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions
• Parametric PDEs: sparse or low-rank approximations?
• A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds
• Projection methods for dynamical low-rank approximation of high-dimensional problems
• Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds
• Riemannian Stochastic Variance Reduced Gradient Algorithm with Retraction and Vector Transport
• A Low-Rank Projector-Splitting Integrator for the Vlasov--Poisson Equation
• A Low-Rank Algorithm for Weakly Compressible Flow
• Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives
• A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
• A Quasi-Conservative Dynamical Low-Rank Algorithm for the Vlasov Equation
• Preconditioned Low-rank Riemannian Optimization for Linear Systems with Tensor Product Structure
• Convergence of a Low-Rank Lie--Trotter Splitting for Stiff Matrix Differential Equations
• Low-rank Riemannian eigensolver for high-dimensional Hamiltonians
• Jacobi--Davidson Method on Low-Rank Matrix Manifolds

Cited In (21)

• Existence of dynamical low-rank approximations to parabolic problems
• From low-rank retractions to dynamical low-rank approximation and back
• An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations
• Dynamically Orthogonal Runge–Kutta Schemes with Perturbative Retractions for the Dynamical Low-Rank Approximation
• Low-rank tensor methods for partial differential equations
• Pricing High-Dimensional Bermudan Options with Hierarchical Tensor Formats
• Implicit low-rank Riemannian schemes for the time integration of stiff partial differential equations
• Riemannian gradient descent methods for graph-regularized matrix completion
• Title not available (Why is that?)
• Riemannian thresholding methods for row-sparse and low-rank matrix recovery
• Riemannian Multigrid Line Search for Low-Rank Problems
• Streaming Tensor Train Approximation
• Cross interpolation for solving high-dimensional dynamical systems on low-rank Tucker and tensor train manifolds
• Constructing low-rank Tucker tensor approximations using generalized completion
• Dynamical low-rank approximation of the Vlasov–Poisson equation with piecewise linear spatial boundary
• Hermite interpolation with retractions on manifolds
• Computing low-rank rightmost eigenpairs of a class of matrix-valued linear operators
• Low-rank nonnegative tensor approximation via alternating projections and sketching
• A Riemannian rank-adaptive method for low-rank matrix completion
• Matrix completion with sparse measurement errors
• Geometry of tree-based tensor formats in tensor Banach spaces

Uses Software

• ARPACK
• LMIRank
• ALEA
• MCTDH

This page was built for publication: Geometric Methods on Low-Rank Matrix and Tensor Manifolds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300541)