Geometric Methods on Low-Rank Matrix and Tensor Manifolds
From MaRDI portal
Publication:3300541
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
Cites work
- scientific article; zbMATH DE number 681023 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 3020007 (Why is no real title available?)
- A Low-Rank Projector-Splitting Integrator for the Vlasov--Poisson Equation
- A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations
- A Riemannian gradient sampling algorithm for nonsmooth optimization on manifolds
- A Riemannian trust region method for the canonical tensor rank approximation problem
- A geometric approach to dynamical model order reduction
- A literature survey of low-rank tensor approximation techniques
- A low-rank algorithm for weakly compressible flow
- A new scheme for the tensor representation
- A projection method to solve linear systems in tensor format
- A projector-splitting integrator for dynamical low-rank approximation
- A quasi-conservative Dynamical Low-rank algorithm for the Vlasov equation
- ARPACK Users' Guide
- Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
- Adaptive stochastic Galerkin FEM with hierarchical tensor representations
- Alternating Projections on Manifolds
- Alternating minimal energy methods for linear systems in higher dimensions
- An adaptive subdivision method for root finding of univariate polynomials
- An area law for one-dimensional quantum systems
- Approximation of Large-Scale Dynamical Systems
- Approximation of 2d²^d matrices using tensor decomposition
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Computational Methods for Linear Matrix Equations
- Convergence of a low-rank Lie-Trotter splitting for stiff matrix differential equations
- Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
- Critical points of matrix least squares distance functions
- Discretized dynamical low-rank approximation in the presence of small singular values
- Dynamical Low‐Rank Approximation
- Dynamical Tensor Approximation
- Dynamical approximation by hierarchical Tucker and tensor-train tensors
- Dynamically orthogonal field equations for continuous stochastic dynamical systems
- Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats
- Error analysis of the dynamically orthogonal approximation of time dependent random PDEs
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- From quantum to classical molecular dynamics: Reduced models and numerical analysis.
- Global rates of convergence for nonconvex optimization on manifolds
- Guarantees of Riemannian optimization for low rank matrix recovery
- Hierarchical Singular Value Decomposition of Tensors
- Hierarchical tensor approximation of output quantities of parameter-dependent PDEs
- Jacobi-Davidson method on low-rank matrix manifolds
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Line search algorithms for locally Lipschitz functions on Riemannian manifolds
- Low rank tensor recovery via iterative hard thresholding
- Low-Rank Explicit QTT Representation of the Laplace Operator and Its Inverse
- Low-rank Riemannian eigensolver for high-dimensional Hamiltonians
- Low-rank matrix completion by Riemannian optimization
- Low-rank retractions: a survey and new results
- Low-rank tensor Krylov subspace methods for parametrized linear systems
- Low-rank tensor completion by Riemannian optimization
- Low-rank tensor methods with subspace correction for symmetric eigenvalue problems
- Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds
- Numerical low-rank approximation of matrix differential equations
- Numerical solution of the finite horizon stochastic linear quadratic control problem
- On manifolds of tensors of fixed TT-rank
- On optimality of approximate low rank solutions of large-scale matrix equations
- On the Early History of the Singular Value Decomposition
- On the approximation of high-dimensional differential equations in the hierarchical Tucker format
- Online learning in the embedded manifold of low-rank matrices
- Parametric PDEs: sparse or low-rank approximations?
- Polynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Format
- Positive definiteness in the numerical solution of Riccati differential equations
- Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure
- Projection methods for dynamical low-rank approximation of high-dimensional problems
- Quantics-TT collocation approximation of parameter-dependent and stochastic elliptic PDEs
- Riemannian Stochastic Variance Reduced Gradient Algorithm with Retraction and Vector Transport
- Riemannian optimization for high-dimensional tensor completion
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- TT-cross approximation for multidimensional arrays
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
- Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives
- Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
- Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
- Tensor numerical methods in quantum chemistry
- Tensor numerical methods in scientific computing
- Tensor spaces and numerical tensor calculus
- Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations
- Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs
- Tensor-train decomposition
- The Gradient Projection Method Along Geodesics
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- The density-matrix renormalization group in the age of matrix product states
- The geometry of algorithms using hierarchical tensors
- Time integration in the multiconfiguration time-dependent Hartree method of molecular quantum dynamics
- Time integration of tensor trains
- \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
Cited in
(30)- On low-rank tensor train approximability for linear nearest neighbor systems
- Randomize low-rank Runge-Kutta methods
- Existence of dynamical low-rank approximations to parabolic problems
- Automatic differentiation for Riemannian optimization on low-rank matrix and tensor-train manifolds
- From low-rank retractions to dynamical low-rank approximation and back
- Dynamically Orthogonal Runge–Kutta Schemes with Perturbative Retractions for the Dynamical Low-Rank Approximation
- Low-rank dynamics
- 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
- scientific article; zbMATH DE number 2112254 (Why is no real title available?)
- Low-rank optimization on Tucker tensor varieties
- An equivalence between critical points for rank constraints versus low-rank factorizations
- Riemannian thresholding methods for row-sparse and low-rank matrix recovery
- Streaming Tensor Train Approximation
- Constructing low-rank Tucker tensor approximations using generalized completion
- Dynamical low-rank approximation of the Vlasov–Poisson equation with piecewise linear spatial boundary
- Cross interpolation for solving high-dimensional dynamical systems on low-rank Tucker and tensor train manifolds
- Computing low-rank rightmost eigenpairs of a class of matrix-valued linear operators
- Randomized methods for dynamical low-rank approximation
- A Riemannian rank-adaptive method for low-rank matrix completion
- Low-rank nonnegative tensor approximation via alternating projections and sketching
- Hermite interpolation with retractions on manifolds
- Approximating maps into manifolds with lower curvature bounds
- Matrix completion with sparse measurement errors
- Geometry of tree-based tensor formats in tensor Banach spaces
- Low-Rank Tensor Completion using Tensor Train Decomposition via Riemannian Optimization on the Quotient Geometry
- Riemannian multigrid line search for low-rank problems
- Dynamical low-rank tensor approximations to high-dimensional parabolic problems: existence and convergence of spatial discretizations
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)
