Pages that link to "Item:Q4598337"
From MaRDI portal
The following pages link to Practical Sketching Algorithms for Low-Rank Matrix Approximation (Q4598337):
Displaying 50 items.
- Random projections for conic programs (Q2040548) (← links)
- An efficient randomized algorithm for computing the approximate Tucker decomposition (Q2049079) (← links)
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs (Q2089773) (← links)
- Proof methods for robust low-rank matrix recovery (Q2106469) (← links)
- Single-pass randomized QLP decomposition for low-rank approximation (Q2107279) (← links)
- Pass-efficient methods for compression of high-dimensional turbulent flow data (Q2123807) (← links)
- Randomized quaternion QLP decomposition for low-rank approximation (Q2162234) (← links)
- Screening for a reweighted penalized conditional gradient method (Q2165597) (← links)
- Scalable \textit{in situ} compression of transient simulation data using time-dependent bases (Q2168287) (← links)
- Randomized QLP decomposition (Q2176120) (← links)
- Distributed estimation of principal eigenspaces (Q2284361) (← links)
- A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization (Q2294351) (← links)
- Single-pass randomized algorithms for LU decomposition (Q2306297) (← links)
- Low-rank nonnegative tensor approximation via alternating projections and sketching (Q2685220) (← links)
- Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation (Q4584924) (← links)
- Practical Sketching Algorithms for Low-Rank Matrix Approximation (Q4598337) (← links)
- Randomized Subspace Iteration: Analysis of Canonical Angles and Unitarily Invariant Norms (Q4615298) (← links)
- (Q4633019) (← links)
- Low-Rank Independence Samplers in Hierarchical Bayesian Inverse Problems (Q4689166) (← links)
- Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization (Q4971021) (← links)
- Randomized Sketching Algorithms for Low-Memory Dynamic Optimization (Q4989933) (← links)
- An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems (Q4997835) (← links)
- Scalable Semidefinite Programming (Q4999352) (← links)
- Sublinear Cost Low Rank Approximation via Subspace Sampling (Q5014667) (← links)
- Why Are Big Data Matrices Approximately Low Rank? (Q5025778) (← links)
- ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
- Low-Rank Tucker Approximation of a Tensor from Streaming Data (Q5037558) (← links)
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models (Q5057098) (← links)
- A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data (Q5070506) (← links)
- Improved Variants of the Hutch++ Algorithm for Trace Estimation (Q5094217) (← links)
- Subspaces Analysis for Random Projection UTV Framework (Q5099408) (← links)
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection (Q5112244) (← links)
- Randomized Discrete Empirical Interpolation Method for Nonlinear Model Reduction (Q5112642) (← links)
- (Q5148925) (← links)
- Memory-Efficient Structured Convex Optimization via Extreme Point Sampling (Q5154636) (← links)
- FANOK: Knockoffs in Linear Time (Q5154638) (← links)
- Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views (Q5194597) (← links)
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation (Q5230655) (← links)
- On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems (Q5853570) (← links)
- Perturbations of CUR Decompositions (Q5857848) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
- Sketching for a low-rank nonnegative matrix approximation: numerical study (Q6038456) (← links)
- Contour Integral Methods for Nonlinear Eigenvalue Problems: A Systems Theoretic Approach (Q6046289) (← links)
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions (Q6052452) (← links)
- An efficient randomized QLP algorithm for approximating the singular value decomposition (Q6052614) (← links)
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations (Q6064026) (← links)
- Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches (Q6066095) (← links)
- Pass-efficient randomized LU algorithms for computing low-rank matrix approximation (Q6073724) (← links)
- Streaming Tensor Train Approximation (Q6074548) (← links)
