The following pages link to Bart Vandereycken (Q389599):
Displaying 36 items.
- The geometry of algorithms using hierarchical tensors (Q389600) (← links)
- Low-rank tensor completion by Riemannian optimization (Q398628) (← links)
- Projection methods for dynamical low-rank approximation of high-dimensional problems (Q2324352) (← links)
- A globally convergent method to compute the real stability radius for time-delay systems (Q2327374) (← links)
- A survey and comparison of contemporary algorithms for computing the matrix geometric mean (Q2447391) (← links)
- Explicit stabilised gradient descent for faster strongly convex optimisation (Q2660598) (← links)
- A note on the optimal convergence rate of descent methods with fixed step sizes for smooth strongly convex functions (Q2671453) (← links)
- Low-rank parareal: a low-rank parallel-in-time integrator (Q2684445) (← links)
- Low-Rank Matrix Completion by Riemannian Optimization (Q2848192) (← links)
- Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors (Q2848621) (← links)
- Subspace Methods for Computing the Pseudospectral Abscissa and the Stability Radius (Q2877090) (← links)
- A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations (Q3079759) (← links)
- Geometric Methods on Low-Rank Matrix and Tensor Manifolds (Q3300541) (← links)
- Robust Rayleigh Quotient Minimization and Nonlinear Eigenvalue Problems (Q4553786) (← links)
- Subspace Acceleration for the Crawford Number and Related Eigenvalue Optimization Problems (Q4569576) (← links)
- Time Integration of Rank-Constrained Tucker Tensors (Q4641635) (← links)
- A Riemannian geometry with complete geodesics for the set of positive semidefinite matrices of fixed rank (Q4920235) (← links)
- Riemannian Multigrid Line Search for Low-Rank Problems (Q4997383) (← links)
- Automatic rational approximation and linearization of nonlinear eigenvalue problems (Q5075142) (← links)
- The Smoothed Spectral Abscissa for Robust Stability Optimization (Q5189555) (← links)
- Time Integration of Tensor Trains (Q5253597) (← links)
- Criss-Cross Type Algorithms for Computing the Real Pseudospectral Abscissa (Q5358298) (← links)
- Preconditioned Low-rank Riemannian Optimization for Linear Systems with Tensor Product Structure (Q5739957) (← links)
- On critical points of quadratic low-rank matrix optimization problems (Q5857358) (← links)
- Streaming Tensor Train Approximation (Q6074548) (← links)
- The leapfrog algorithm as nonlinear Gauss-Seidel (Q6352330) (← links)
- Randomized sketching of nonlinear eigenvalue problems (Q6418098) (← links)
- Implicit low-rank Riemannian schemes for the time integration of stiff partial differential equations (Q6437186) (← links)
- Projected exponential methods for stiff dynamical low-rank approximation problems (Q6461621) (← links)
- Implicit low-rank Riemannian schemes for the time integration of stiff partial differential equations (Q6608074) (← links)
- Randomized sketching of nonlinear eigenvalue problems (Q6623715) (← links)
- Geodesic convexity of the symmetric eigenvalue problem and convergence of steepest descent (Q6636815) (← links)
- Gradient-type subspace iteration methods for the symmetric eigenvalue problem (Q6659698) (← links)
- A Nesterov-style Accelerated Gradient Descent Algorithm for the Symmetric Eigenvalue Problem (Q6734132) (← links)
- A geodesic convexity-like structure for the polar decomposition of a square matrix (Q6758750) (← links)
- A preconditioned inverse iteration with an improved convergence guarantee (Q6758874) (← links)
