swMATH8365MaRDI QIDQ20374FDOQ20374
Author name not available (Why is that?)
Official website: http://www.cs.ubc.ca/~mpf/spgl1/
Source code repository: https://github.com/vegarant/spgl1
Cited In (only showing first 100 items - show all)
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Easy implementation of advanced tomography algorithms using the ASTRA toolbox with spot operators
- Fixed point and Bregman iterative methods for matrix rank minimization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Gradient descent and fast artificial time integration
- Algorithms that satisfy a stopping criterion, probably
- RASL
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
- Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing
- Phase transitions for greedy sparse approximation algorithms
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
- Fast projection onto the simplex and the \(l_1\) ball
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- Matrix-free interior point method for compressed sensing problems
- A numerical exploration of compressed sampling recovery
- CVX
- levmar
- SFSDP
- PDCO
- FXT
- hfloat
- BLOOMP
- Spot
- NESTA
- NPtool
- CoDoSol
- Sparco
- UNLocBoX
- Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere
- elsA
- ParNes
- CoSaMP
- Gurobi Mex
- Healpix
- Kiva-2
- CurveLab
- SparseLab
- VIALS
- Yall1
- na28
- dr
- FPC_AS
- FTVd
- GAGA
- LMaFit
- RecPF
- Eigentaste
- Jellyfish
- L1-MAGIC
- RESINVM3D
- TFOCS
- SLEP
- Smolpack
- HRMSYM
- nwSpGr
- ggks
- PATSYM
- l1_ls
- tomoRecon
- Spline Toolbox
- coneproj
- FPC
- L1TestPack
- PNOPT
- SpaRSA
- TwIST
- PhasePack
- MRI Simulation and Reconstruction
- smerfs
- GESPAR
- ADMM
- CGIST
- IPsolve
- WebGraph
- ADMiRA
- ADMM_QAP
- LPCCbnc
- Optimal-SPCA
- FASTA
- sparseFFTr1l
- corner.m
- CWW
- infCS
- APG
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis
- Alternating direction method of multipliers for sparse principal component analysis
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Efficient block-coordinate descent algorithms for the group Lasso
- Templates for convex cone problems with applications to sparse signal recovery
- Guaranteed clustering and biclustering via semidefinite programming
- IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
- Sparse polynomial chaos expansions: literature survey and benchmark
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- Two-dimensional random projection
- Numerical methods for \(A\)-optimal designs with a sparsity constraint for ill-posed inverse problems
This page was built for software: SPGL1
