Cited in
(only showing first 100 items - show all)- Estimation and Uncertainty Quantification for Piecewise Smooth Signal Recovery
- Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
- A new computational method for the sparsest solutions to systems of linear equations
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
- Independent multiresolution component analysis and matching pursuit
- Another look at Huber's estimator: a new minimax estimator in regression with stochastically bounded noise
- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery
- Bayesian hierarchical dictionary learning
- Critical behavior and universality classes for an algorithmic phase transition in sparse reconstruction
- A general theory of concave regularization for high-dimensional sparse estimation problems
- High-dimensional regression with unknown variance
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
- Nomonotone spectral gradient method for sparse recovery
- Compressive Sensing
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Spectrum estimation for large dimensional covariance matrices using random matrix theory
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- Existence, uniqueness, and approximation solutions to linearized Chandrasekhar equation with sharp bounds
- Sparsity-promoting elastic net method with rotations for high-dimensional nonlinear inverse problem
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- Sparsest piecewise-linear regression of one-dimensional data
- Super-resolution by means of Beurling minimal extrapolation
- Multi-layer sparse coding: the holistic way
- Splitting matching pursuit method for reconstructing sparse signal in compressed sensing
- Parsimonious additive models
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Feature selection when there are many influential features
- Remote sensing via _1-minimization
- Sharp recovery bounds for convex demixing, with applications
- PROMP: a sparse recovery approach to lattice-valued signals
- Spectral dynamics and regularization of incompletely and irregularly measured data
- A two-stage regularization method for variable selection and forecasting in high-order interaction model
- Spectral Compressed Sensing via Projected Gradient Descent
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Convex feasibility modeling and projection methods for sparse signal recovery
- Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems
- Sparse Legendre expansions via _1-minimization
- Strong convergence of a modified proximal algorithm for solving the lasso
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- Two-dimensional random projection
- Inferring sparse Gaussian graphical models with latent structure
- Compressing sensing based source localization for controlled acoustic signals using distributed microphone arrays
- Persistene in high-dimensional linear predictor-selection and the virtue of overparametrization
- UPS delivers optimal phase diagram in high-dimensional variable selection
- GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm
- A phase transition for finding needles in nonlinear haystacks with LASSO artificial neural networks
- LASSO for streaming data with adaptative filtering
- Understanding neural networks with reproducing kernel Banach spaces
- Sparse recovery of sound fields using measurements from moving microphones
- A proximal method for composite minimization
- Greedy approximate projection for magnetic resonance fingerprinting with partial volumes
- Minimizers of sparsity regularized Huber loss function
- Stability of 1-bit compressed sensing in sparse data reconstruction
- Globally sparse and locally dense signal recovery for compressed sensing
- Local search methods for \(\ell_{1}\)-minimization in frame based signal compression
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis
- An unbiased approach to compressed sensing
- A bilinear algorithm for sparse representations
- Asymptotics for Lasso-type estimators.
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- An accelerated forward-backward splitting algorithm for solving inclusion problems with applications to regression and link prediction problems
- A weighted randomized sparse Kaczmarz method for solving linear systems
- Embedded feature-selection support vector machine for driving pattern recognition
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- Extensions of Gauss quadrature via linear programming
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Discussion: ``A significance test for the lasso
- Discussion: ``A significance test for the lasso
- Discussion: ``A significance test for the lasso
- Discussion: ``A significance test for the lasso
- Sparsity regularization in inverse problems
- Confidence intervals for low dimensional parameters in high dimensional linear models
- Model recovery for Hammerstein systems using the auxiliary model based orthogonal matching pursuit method
- Adaptive Dantzig density estimation
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- Maximal solutions of sparse analysis regularization
- Model-based multiple rigid object detection and registration in unstructured range data
- A unified primal-dual algorithm framework based on Bregman iteration
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- JAXopt
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- Structured sparsity promoting functions
- On the size of incoherent systems
- Image denoising via solution paths
- Sparse approximate solution of partial differential equations
- Design of c-optimal experiments for high-dimensional linear models
- Sparsity based methods for overparameterized variational problems
- Non-convex optimization via strongly convex majorization-minimization
This page was built for software: PDCO
