The following pages link to PROPACK (Q16208):
Displaying 34 items.
- Efficient algorithms for robust and stable principal component pursuit problems (Q2450901) (← links)
- A unified approach for minimizing composite norms (Q2452377) (← links)
- A fast symmetric SVD algorithm for square Hankel matrices (Q2465321) (← links)
- SVD based initialization: A head start for nonnegative matrix factorization (Q2469730) (← links)
- A preconditioned GMRES for complex dense linear systems from electromagnetic wave scattering problems (Q2497246) (← links)
- A Lanczos-like reduction of symmetric structured matrices to semiseparable form (Q2504981) (← links)
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets (Q2511197) (← links)
- Fast singular value thresholding without singular value decomposition (Q2511250) (← links)
- Robust principal component pursuit via inexact alternating minimization on matrix manifolds (Q2515360) (← links)
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems (Q2566637) (← links)
- Proximal linearization methods for Schatten \(p\)-quasi-norm minimization (Q2678970) (← links)
- Hybrid iterative refined restarted Lanczos bidiagonalization methods (Q2679823) (← links)
- Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition (Q2699387) (← links)
- Large-Scale Inverse Problems in Imaging (Q2789799) (← links)
- Recovery of Low Rank Symmetric Matrices via Schatten p Norm Minimization (Q2800802) (← links)
- A DEIM Induced CUR Factorization (Q2810324) (← links)
- Low-Rank Spectral Optimization via Gauge Duality (Q2811991) (← links)
- Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods (Q2830569) (← links)
- Normalized Iterative Hard Thresholding for Matrix Completion (Q2870672) (← links)
- Subspace Methods for Computing the Pseudospectral Abscissa and the Stability Radius (Q2877090) (← links)
- (Q2896145) (← links)
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations (Q3004974) (← links)
- An Efficient Iterative Approach for Large-Scale Separable Nonlinear Inverse Problems (Q3066223) (← links)
- A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices (Q3084401) (← links)
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems (Q3116469) (← links)
- A Self-Learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs (Q3165420) (← links)
- A Filtered Lanczos Procedure for Extreme and Interior Eigenvalue Problems (Q3165425) (← links)
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing (Q3189422) (← links)
- Computational Materials Science and Engineering (Q3300493) (← links)
- A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices (Q3447456) (← links)
- A Hybrid LSMR Algorithm for Large-Scale Tikhonov Regularization (Q3449797) (← links)
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition (Q5218403) (← links)
- Median filtering‐based methods for static background extraction from surveillance video (Q5739729) (← links)
- Iterative representing set selection for nested cross approximation (Q5739759) (← links)
