PROPACK
From MaRDI portal
Cited in
(only showing first 100 items - show all)- EIGIFP
- LSQR
- COBRA
- eigs
- JDQR
- PRIMME
- TRLan
- TMG
- A partially isochronous splitting algorithm for three-block separable convex minimization problems
- Randomized LU decomposition
- Using negative curvature in solving nonlinear programs
- A new shift strategy for the implicitly restarted refined harmonic Lanczos method
- svdpack
- A deterministic-stochastic method for computing the Boltzmann collision integral in \(\mathcal{O}(MN)\) operations
- VanHuffel
- Templates for convex cone problems with applications to sparse signal recovery
- Flexible low-rank statistical modeling with missing data and side information
- CPMD
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- NESTA
- JDQZ
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
- Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
- NMFLAB
- ParNes
- Fast Cadzow's algorithm and a gradient variant
- IRAM
- Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization
- MIKA
- Computing interior eigenvalues of large sparse symmetric matrices
- Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation
- On obtaining sparse semantic solutions for inverse problems, control, and neural network training
- An efficient, memory-saving approach for the Loewner framework
- Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
- Matrix completion for matrices with low-rank displacement
- Computing the smallest singular triplets of a large matrix
- On the convergence of Krylov methods with low-rank truncations
- Matrix recipes for hard thresholding methods
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- Tpetra
- Lanczos method for large-scale quaternion singular value decomposition
- Yall1
- A cross-product approach for low-rank approximations of large matrices
- Optimally linearizing the alternating direction method of multipliers for convex programming
- Provable accelerated gradient method for nonconvex low rank optimization
- Randomized core reduction for discrete ill-posed problem
- na26
- Recovering low-rank matrices from corrupted observations via the linear conjugate gradient algorithm
- Data clustering with quantum mechanics
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- FTVd
- LMaFit
- softImpute
- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
- Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension
- Computation of the maximum likelihood estimator in low-rank factor analysis
- L1-MAGIC
- Eigentaste
- Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
- Efficient algorithms for robust and stable principal component pursuit problems
- A unified approach for minimizing composite norms
- Optspace
- A fast symmetric SVD algorithm for square Hankel matrices
- SVD based initialization: A head start for nonnegative matrix factorization
- A preconditioned GMRES for complex dense linear systems from electromagnetic wave scattering problems
- A Lanczos-like reduction of symmetric structured matrices to semiseparable form
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- Fast singular value thresholding without singular value decomposition
- Robust principal component pursuit via inexact alternating minimization on matrix manifolds
- SLEP
- PHSVDS
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- An alternating direction method with continuation for nonconvex low rank minimization
- RSVDPACK
- impute
- bioNMF
- GenRTR
- ID
- Proximal linearization methods for Schatten p-quasi-norm minimization
- WebSeer
- Hybrid iterative refined restarted Lanczos bidiagonalization methods
- Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition
- PRIMME_SVDS
- h2tools
- Large-Scale Inverse Problems in Imaging
- rsvd
- Recovery of low rank symmetric matrices via Schatten p norm minimization
- A DEIM induced CUR factorization
- Low-rank spectral optimization via gauge duality
- Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
- Normalized iterative hard thresholding for matrix completion
- Subspace methods for computing the pseudospectral abscissa and the stability radius
- Spectral regularization algorithms for learning large incomplete matrices
- Megaman
- DVDSON
- Minimum n-rank approximation via iterative hard thresholding
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- An efficient iterative approach for large-scale separable nonlinear inverse problems
- A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
This page was built for software: PROPACK
