SPGL1
From MaRDI portal
Cited in
(only showing first 100 items - show all)- ASTRA
- STRSCNE
- LASSO
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Infinite-dimensional compressed sensing and function interpolation
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- CVX
- Generalized Kalman smoothing: modeling and algorithms
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
- SFSDP
- levmar
- The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
- PDCO
- Greedy subspace pursuit for joint sparse recovery
- Level-set methods for convex optimization
- FXT
- hfloat
- Iterative algorithms for total variation-like reconstructions in seismic tomography
- Templates for convex cone problems with applications to sparse signal recovery
- Recovery of seismic wavefields by an \(l_{q}\)-norm constrained regularization method
- Spot
- BLOOMP
- NESTA
- NPtool
- CoDoSol
- Sparco
- Accelerated linearized Bregman method
- A cyclic projected gradient method
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- UNLocBoX
- elsA
- An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
- A performance guarantee for orthogonal matching pursuit using mutual coherence
- Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
- A projection method for convex constrained monotone nonlinear equations with applications
- Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares
- The distance between convex sets with Minkowski sum structure: application to collision detection
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
- Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm
- ParNes
- SSN: learning sparse switchable normalization via SparsestMax
- Structure exploiting methods for fast uncertainty quantification in multiphase flow through heterogeneous media
- New strong convergence method for the sum of two maximal monotone operators
- CoSaMP
- Gurobi Mex
- Learning ``best kernels from data in Gaussian process regression. With application to aerodynamics
- Healpix
- Kiva-2
- Convex optimization under combinatorial sparsity constraints
- Generalization bounds for sparse random feature expansions
- Compressed sensing in the spherical near-field to far-field transformation
- Efficient projection algorithms onto the weighted \(\ell_1\) ball
- Parallel multipopulation optimization for belief rule base learning
- Regularization proximal method for monotone variational inclusions
- VIALS
- SparseLab
- Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems
- Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
- Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising
- A note on the spectral gradient projection method for nonlinear monotone equations with applications
- A polynomial chaos framework for probabilistic predictions of storm surge events
- A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball
- Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery
- CurveLab
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- Level set methods for stochastic discontinuity detection in nonlinear problems
- Generation of nested quadrature rules for generic weight functions via numerical optimization: application to sparse grids
- Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence
- A perturbation view of level-set methods for convex optimization
- Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery
- A compressed-sensing approach for closed-loop optimal control of nonlinear systems
- A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation
- Homogeneous penalizers and constraints in convex image restoration
- A numerical exploration of compressed sampling recovery
- Signal reconstruction by conjugate gradient algorithm based on smoothing l₁-norm
- A gradient descent based algorithm for \(\ell_p\) minimization
- Analysis of compressed distributed adaptive filters
- Yall1
- Numerical analysis for conservation laws using \(l_1\) minimization
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- \(h\)-\(p\) adaptive model based approximation of moment free sensitivity indices
- Nonsmooth sparsity constrained optimization problems: optimality conditions
- Reconstruction of jointly sparse vectors via manifold optimization
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
- A fast algorithm for solving linear inverse problems with uniform noise removal
- Enabling numerically exact local solver for waveform inversion -- a low-rank approach
- Constructing \(L_1\)-graphs for subspace learning via recurrent neural networks
- Alternating direction method of multipliers for solving dictionary learning models
- na28
- Optimality properties of an augmented Lagrangian method on infeasible problems
- A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
- Sparsity optimization in design of multidimensional filter networks
- Fusion of sparse reconstruction algorithms for multiple measurement vectors
- Global sensitivity analysis based on high-dimensional sparse surrogate construction
- dr
- Efficient block-coordinate descent algorithms for the group Lasso
- The modified accelerated Bregman method for regularized basis pursuit problem
- Polyak's gradient method for split feasibility problem constrained by level sets
This page was built for software: SPGL1
