An efficient semismooth Newton method for adaptive sparse signal recovery problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7652674
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
- Non-smooth equations based method for _1-norm problems with applications to compressed sensing
- Fast L1-L2 minimization via a proximal operator
- Group sparse recovery in impulsive noise via alternating direction method of multipliers
Cites work
- \(\ell_1\)-penalized quantile regression in high-dimensional sparse models
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
- A nonsmooth version of Newton's method
- A semi-smooth Newton method for inverse problem with uniform noise
- An efficient and globally convergent algorithm for \(\ell_{p,q} - \ell_r\) model in group sparse optimization
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Composite difference-MAX programs for modern statistical estimation problems
- Compressed sensing
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
- Computing sparse representation in a highly coherent dictionary based on difference of L₁ and L₂
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Decoding by Linear Programming
- Fast L1-L2 minimization via a proximal operator
- Hankel matrix rank minimization with applications to system identification and realization
- scientific article; zbMATH DE number 4082855 (Why is no real title available?)
- scientific article; zbMATH DE number 7306909 (Why is no real title available?)
- scientific article; zbMATH DE number 3244852 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- Inexact Newton methods for solving nonsmooth equations
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Iteratively reweighted least squares minimization for sparse recovery
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Optimization and nonsmooth analysis
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Proximité et dualité dans un espace hilbertien
- Semismooth and Semiconvex Functions in Constrained Optimization
- Slope meets Lasso: improved oracle bounds and optimality
- Sparse representations in unions of bases
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- The L₁ penalized LAD estimator for high dimensional linear regression
- Variational Analysis
Cited in
(9)- Group sparse recovery in impulsive noise via alternating direction method of multipliers
- Globally sparse and locally dense signal recovery for compressed sensing
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
- scientific article; zbMATH DE number 7652674 (Why is no real title available?)
- Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery
- An Efficient Semismooth Newton Method for Adaptive Sparse Signal Recovery Problems
- A fast and effective algorithm for sparse linear regression with \(\ell_p\)-norm data fidelity and elastic net regularization
- Sparse optimization of vibration signal by ADMM
- Graph-based Square-Root Estimation for Sparse Linear Regression
This page was built for publication: An efficient semismooth Newton method for adaptive sparse signal recovery problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882234)
