SPGL1

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

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)

• 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
• Optimal estimation of \(\ell_1\)-regularization prior from a regularized empirical Bayesian risk standpoint
• 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
• A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
• The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
• Constructing surrogate models of complex systems with enhanced sparsity: quantifying the influence of conformational uncertainty in biomolecular solvation
• Stochastic collocation algorithms using \(l_1\)-minimization for Bayesian solution of inverse problems
• 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)
• Penalty methods for a class of non-Lipschitz optimization problems
• New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints
• Fast projection onto the simplex and the \(l_1\) ball
• Enhancing sparsity of Hermite polynomial expansions by iterative rotations
• Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares
• Sparse solutions of a class of constrained optimization problems
• Source localization using a sparse representation framework to achieve superresolution
• 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
• Optimality properties of an augmented Lagrangian method on infeasible problems
• A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
• Level-set methods for convex optimization
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• Sparse high-dimensional FFT based on rank-1 lattice sampling
• A gradient descent based algorithm for \(\ell_p\) minimization
• Learning circulant sensing kernels
• First-order optimality condition of basis pursuit denoise problem
• A note on the spectral gradient projection method for nonlinear monotone equations with applications
• 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
• 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
• The alternating descent conditional gradient method for sparse inverse problems
• Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
• Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
• Polyak's gradient method for split feasibility problem constrained by level sets
• Basis adaptive sample efficient polynomial chaos (BASE-PC)
• Dualization of signal recovery problems
• Sparse microwave imaging: principles and applications
• Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
• Combining line search and trust-region methods forℓ1-minimization
• Solving basis pursuit: heuristic optimality check and solver comparison
• Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
• Composite self-concordant minimization
• A general non-Lipschitz infimal convolution regularized model: Lower bound theory and algorithm
• 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
• Compressive imaging and characterization of sparse light deflection maps
• An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
• A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
• An algorithm solving compressive sensing problem based on maximal monotone operators
• BIJ
• 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
• 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
• Matrix-free interior point method for compressed sensing problems
• A numerical exploration of compressed sampling recovery
• ASTRA
• STRSCNE
• LASSO
• 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

This page was built for software: SPGL1