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)

• 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
• On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty 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
• 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 highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
• 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
• A level-set method for convex optimization with a feasible solution path
• Joint sparse recovery based on variances
• Iterative algorithms for total variation-like reconstructions in seismic tomography
• Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
• 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
• Optimality properties of an augmented Lagrangian method on infeasible problems
• A practical guide to the recovery of wavelet coefficients from Fourier measurements
• GPU accelerated greedy algorithms for compressed sensing
• Inexact primal-dual gradient projection methods for nonlinear optimization on convex set
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• Recovery of seismic wavefields by an \(l_{q}\)-norm constrained regularization method
• Fusion of sparse reconstruction algorithms for multiple measurement vectors
• On sparse reconstructions in near-field acoustic holography using the method of superposition
• A gradient descent based algorithm for \(\ell_p\) minimization
• Optimal dual certificates for noise robustness bounds in compressive sensing
• A note on the spectral gradient projection method for nonlinear monotone equations with applications
• A regularized semi-smooth Newton method with projection steps for composite convex programs
• Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
• Extracting Sparse High-Dimensional Dynamics from Limited Data
• A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation
• Sampling in the analysis transform domain
• Super-resolution radar
• Stochastic Collocation vial₁-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
• The alternating descent conditional gradient method for sparse inverse problems
• Polyak's gradient method for split feasibility problem constrained by level sets
• Basis adaptive sample efficient polynomial chaos (BASE-PC)
• Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
• The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
• Sparse representation based two-dimensional direction of arrival estimation using co-prime array
• Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
• Combining line search and trust-region methods forℓ1-minimization
• CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
• A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
• An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
• A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
• An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
• A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
• Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
• Structure exploiting methods for fast uncertainty quantification in multiphase flow through heterogeneous media
• Numerical integration in multiple dimensions with designed quadrature
• Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
• Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
• Randomized block proximal damped Newton method for composite self-concordant minimization
• Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
• Sparse polynomial chaos expansions: literature survey and benchmark
• 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
• 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
• 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
• 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)
• Penalty methods for a class of non-Lipschitz optimization problems
• 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
• Sparse solutions of a class of constrained optimization problems
• 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

This page was built for software: SPGL1