PROPACK
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Accelerating convergence by augmented Rayleigh-Ritz projections for large-scale eigenpair computation
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- The joint bidiagonalization process with partial reorthogonalization
- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
- An alternating direction method with continuation for nonconvex low rank minimization
- Normalized iterative hard thresholding for matrix completion
- A proximal point algorithm for sequential feature extraction applications
- Spectral Compressed Sensing via Projected Gradient Descent
- Low-rank optimization with trace norm penalty
- An implementable proximal point algorithmic framework for nuclear norm minimization
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- Randomized core reduction for discrete ill-posed problem
- A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Flexible low-rank statistical modeling with missing data and side information
- A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
- Spectral Computed Tomography with Linearization and Preconditioning
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Cobra: Parallel path following for computing the matrix pseudospectrum
- Spectral regularization algorithms for learning large incomplete matrices
- A fast symmetric SVD algorithm for square Hankel matrices
- Low-rank spectral optimization via gauge duality
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
- A DEIM induced CUR factorization
- An efficient Gauss-Newton algorithm for symmetric low-rank product matrix approximations
- A hybrid LSMR algorithm for large-scale Tikhonov regularization
- A Lanczos-like reduction of symmetric structured matrices to semiseparable form
- Parallel Prony's Method with Multivariate Matrix Pencil Approach and Its Numerical Aspects
- Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
- Lanczos and the Riemannian SVD in information retrieval applications
- Fast singular value thresholding without singular value decomposition
- Proximal linearization methods for Schatten \(p\)-quasi-norm minimization
- Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation
- A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
- An efficient iterative approach for large-scale separable nonlinear inverse problems
- Minimum n-rank approximation via iterative hard thresholding
- Collective matrix completion
- Median filtering-based methods for static background extraction from surveillance video.
- On obtaining sparse semantic solutions for inverse problems, control, and neural network training
- Computing the smallest singular triplets of a large matrix
- Iterative representing set selection for nested cross approximation.
- A filtered Lanczos procedure for extreme and interior eigenvalue problems
- Approximating the leading singular triplets of a large matrix function
- A self-learning algebraic multigrid method for extremal singular triplets and eigenpairs
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Recovery of low rank symmetric matrices via Schatten \(p\) norm minimization
- Data clustering with quantum mechanics
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Matrix completion via minimizing an approximate rank
- An efficient, memory-saving approach for the Loewner framework
- Computing real solutions of polynomial systems via low-rank moment matrix completion
- Optimally linearizing the alternating direction method of multipliers for convex programming
- Fast Cadzow's algorithm and a gradient variant
- Provable accelerated gradient method for nonconvex low rank optimization
- The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
- A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization
- Matrix completion for matrices with low-rank displacement
- Computing the Kreiss constant of a matrix
- Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
- Large-Scale Inverse Problems in Imaging
- An iterative algorithm for third-order tensor multi-rank minimization
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
- Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
- ROSTAPACK
- EIGIFP
- LSQR
- COBRA
- eigs
- JDQR
- PRIMME
- TRLan
- TMG
- svdpack
- VanHuffel
- CPMD
- NESTA
- JDQZ
- NMFLAB
- ParNes
- IRAM
- MIKA
- Tpetra
- Yall1
- na26
- FTVd
- LMaFit
- Eigentaste
- softImpute
- L1-MAGIC
- Optspace
- SLEP
- PHSVDS
- RSVDPACK
- bioNMF
- impute
- GenRTR
- ID
This page was built for software: PROPACK
