Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
From MaRDI portal
Publication:5219700
Cites work
- 10.1162/153244303322753751
- A relaxed constant positive linear dependence constraint qualification and applications
- A Statistical View of Some Chemometrics Regression Tools
- An augmented Lagrangian approach for sparse principal component analysis
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- An interior-point method for large-scale l₁-regularized logistic regression
- Analysis of multi-stage convex relaxation for sparse regularization
- Atomic Decomposition by Basis Pursuit
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Compressed sensing
- Decoding by Linear Programming
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Generalized Gradients and Applications
- High-Resolution Radar via Compressed Sensing
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Iterative thresholding for sparse approximations
- Nearly unbiased variable selection under minimax concave penalty
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Optimization and nonsmooth analysis
- Penalty methods for a class of non-Lipschitz optimization problems
- Restricted isometry properties and nonconvex compressive sensing
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Sparse Approximation via Penalty Decomposition Methods
- Sparse Reconstruction by Separable Approximation
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Stable recovery of sparse overcomplete representations in the presence of noise
- The Pros and Cons of Compressive Sensing for Wideband Signal Acquisition: Noise Folding versus Dynamic Range
- Two-Point Step Size Gradient Methods
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Analysis
Cited in
(28)- Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning
- Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
- The complexity results of the sparse optimization problems and reverse convex optimization problems
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression
- A residual-based algorithm for solving a class of structured nonsmooth optimization problems
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- Model's sparse representation based on reduced mixed GMsFE basis methods
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- Partial \(S\)-goodness for partially sparse signal recovery
- Sparse Recovery With Unknown Variance: A LASSO-Type Approach
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- Mini-workshop: Mathematical physics meets sparse recovery. Abstracts from the mini-workshop held April 13--19, 2014.
- A general theory for subspace-sparse recovery
- SPOQ $\ell _p$-Over-$\ell _q$ Regularization for Sparse Signal Recovery Applied to Mass Spectrometry
- Robust signal recovery for \(\ell_{1-2}\) minimization via prior support information
- Penalty and augmented Lagrangian methods for constrained DC programming
- Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
- Inexact proximal DC Newton-type method for nonconvex composite functions
- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems
- Sparse Recovery via Partial Regularization: Models, Theory and Algorithms
- Penalty method for the sparse portfolio optimization problem
- A new generalized shrinkage conjugate gradient method for sparse recovery
- A new linearized alternating direction method of multipliers with adaptive step size and its inexact version for fused Lasso regression model
- Nonconvex regularizer and homotopy-based sparse optimization: convergent algorithms and applications
- Convergence of a class of algorithms with the level-set subdifferential error bound
- Sparse projection onto semi-symmetric sets with applications to sparse optimization
- Title not available (Why is no real title available?)
This page was built for publication: Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5219700)
