SPGL1

swMATH8365MaRDI QIDQ20374FDOQ20374

Author name not available (Why is that?)

Source code repository: https://github.com/vegarant/spgl1

Described by source

• Sparse Optimization with Least-Squares Constraints
• Probing the Pareto Frontier for Basis Pursuit Solutions

Cited In (only showing first 100 items - show all)

• Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
• Penalty Methods for a Class of Non-Lipschitz Optimization Problems
• Easy implementation of advanced tomography algorithms using the ASTRA toolbox with spot operators
• Two-dimensional random projection
• Fixed point and Bregman iterative methods for matrix rank minimization
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
• Sparse Solutions of a Class of Constrained Optimization Problems
• Gradient descent and fast artificial time integration
• Algorithms that satisfy a stopping criterion, probably
• Accelerated linearized Bregman method
• Infinite-dimensional compressed sensing and function interpolation
• A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
• On the representation of functions with Gaussian wave packets
• 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
• Compressive Imaging and Characterization of Sparse Light Deflection Maps
• Phase transitions for greedy sparse approximation algorithms
• Generalized Kalman smoothing: modeling and algorithms
• Compressive sampling and \(\ell_1\) minimization for SAR imaging with low sampling rate
• \(L^1\) regularization method in electrical impedance tomography by using the \(L^1\)-curve (Pareto frontier curve)
• 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
• Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares
• Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
• A projection method for convex constrained monotone nonlinear equations with applications
• ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
• Convex optimization under combinatorial sparsity constraints
• Matrix-free interior point method for compressed sensing problems
• A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
• Solving Basis Pursuit
• Level-set methods for convex optimization
• A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm
• A numerical exploration of compressed sampling recovery
• Sparse high-dimensional FFT based on rank-1 lattice sampling
• An Algorithm Solving Compressive Sensing Problem Based on Maximal Monotone Operators
• A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging
• Learning circulant sensing kernels
• First-order optimality condition of basis pursuit denoise problem
• Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere
• Composite Self-Concordant Minimization
• Constructing Surrogate Models of Complex Systems with Enhanced Sparsity: Quantifying the Influence of Conformational Uncertainty in Biomolecular Solvation
• The Quest for Optimal Sampling: Computationally Efficient, Structure-Exploiting Measurements for Compressed Sensing
• Projected Landweber iteration for matrix completion
• Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
• A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
• Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
• Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
• A unified approach for minimizing composite norms
• Quantifying initial and wind forcing uncertainties in the gulf of Mexico
• A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
• IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems
• Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
• Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
• Projection algorithms for nonconvex minimization with application to sparse principal component analysis
• Dualization of signal recovery problems
• Sparse microwave imaging: principles and applications
• 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
• Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
• Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
• Efficient block-coordinate descent algorithms for the group Lasso
• Stochastic Collocation Algorithms Using $l_1$-Minimization for Bayesian Solution of Inverse Problems
• Homogeneous penalizers and constraints in convex image restoration
• On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
• Analysis of compressed distributed adaptive filters
• Faster gradient descent and the efficient recovery of images
• Templates for convex cone problems with applications to sparse signal recovery
• Guaranteed clustering and biclustering via semidefinite programming
• 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
• Reconstruction of jointly sparse vectors via manifold optimization
• Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
• Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
• The modified accelerated Bregman method for regularized basis pursuit problem
• Optimized Sampling for Multiscale Dynamics
• Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
• Sparsity optimization in design of multidimensional filter networks
• Sparse approximate solution of partial differential equations
• Inexact primal–dual gradient projection methods for nonlinear optimization on convex set
• Numerical methods for \(A\)-optimal designs with a sparsity constraint for ill-posed inverse problems
• Optimal estimation of \(\ell_1\)-regularization prior from a regularized empirical Bayesian risk standpoint
• A cyclic projected gradient method
• Greedy subspace pursuit for joint sparse recovery
• A performance guarantee for orthogonal matching pursuit using mutual coherence
• The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
• Iterative algorithms for total variation-like reconstructions in seismic tomography
• Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures
• Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
• Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions
• Numerical Integration in Multiple Dimensions with Designed Quadrature
• A perturbation view of level-set methods for convex optimization
• Level set methods for stochastic discontinuity detection in nonlinear problems
• New strong convergence method for the sum of two maximal monotone operators
• A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
• New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints
• Enhancing sparsity of Hermite polynomial expansions by iterative rotations
• Source localization using a sparse representation framework to achieve superresolution
• The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems

This page was built for software: SPGL1