An efficient semismooth Newton method for adaptive sparse signal recovery problems

DOI10.1080/10556788.2022.2120983OpenAlexW3216149118MaRDI QIDQ5882234

Peili Li, Hai-Bin Zhang, Yanyun Ding, Yun-hai Xiao

Publication date: 15 March 2023

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.12252

zbMATH Keywords

Clarke subdifferentialcompressive sensingsemismooth Newton methodproximal majorization-minimization\(\ell_p\)-\(\ell_{1-2}\) minimization

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Numerical analysis (65-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(L_1\) penalized LAD estimator for high dimensional linear regression
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
• Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
• A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
• A semi-smooth Newton method for inverse problem with uniform noise
• Fast L1-L2 minimization via a proximal operator
• Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
• Inexact Newton methods for solving nonsmooth equations
• An efficient and globally convergent algorithm for \(\ell_{p,q} - \ell_r\) model in group sparse optimization
• Slope meets Lasso: improved oracle bounds and optimality
• A nonsmooth version of Newton's method
• \(\ell_1\)-penalized quantile regression in high-dimensional sparse models
• Complexity of unconstrained \(L_2 - L_p\) minimization
• Hankel Matrix Rank Minimization with Applications to System Identification and Realization
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• Square-root lasso: pivotal recovery of sparse signals via conic programming
• Decoding by Linear Programming
• Sparse representations in unions of bases
• Iteratively reweighted least squares minimization for sparse recovery
• Optimization and nonsmooth analysis
• Semismooth and Semiconvex Functions in Constrained Optimization
• Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
• Variational Analysis
• Composite Difference-Max Programs for Modern Statistical Estimation Problems
• A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Minimization of $\ell_{1-2}$ for Compressed Sensing
• Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Proximité et dualité dans un espace hilbertien
• Compressed sensing

This page was built for publication: An efficient semismooth Newton method for adaptive sparse signal recovery problems