New regularization method and iteratively reweighted algorithm for sparse vector recovery

DOI10.1007/s10483-020-2561-6zbMath1462.49047OpenAlexW2984554231WikidataQ126845147 ScholiaQ126845147MaRDI QIDQ2033724

Hui Zhang, Li-Zhi Cheng, Wei Zhu

Publication date: 17 June 2021

Published in: AMM. Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10483-020-2561-6

zbMATH Keywords

regularization methoditeratively reweighted algorithm (IR-algorithm)sparse vector recovery

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Optimality conditions for minimax problems (49K35)

Related Items (1)

A Lorentzian-\(\ell_p\) norm regularization based algorithm for recovering sparse signals in two types of impulsive noise

Cites Work

• Unnamed Item
• Unnamed Item
• First-order optimality condition of basis pursuit denoise problem
• A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm
• A note on the complexity of \(L _{p }\) minimization
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Theoretical foundations and numerical methods for sparse recovery. Papers based on the presentations of the summer school ``Theoretical foundations and numerical methods for sparse recovery, Vienna, Austria, August 31 -- September 4, 2009.
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Elastic-net regularization in learning theory
• Higher order convergence rates for Bregman iterated variational regularization of inverse problems
• Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
• Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
• An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• Analysis and Generalizations of the Linearized Bregman Method
• Linearized Bregman iterations for compressed sensing
• Nuclear norm regularization with a low-rank constraint for matrix completion
• Regularization with non-convex separable constraints
• Restricted isometry properties and nonconvex compressive sensing
• Sparse regularization with l ^q penalty term
• Elastic-net regularization: error estimates and active set methods
• Iteratively reweighted least squares minimization for sparse recovery
• Minimizing Nonconvex Functions for Sparse Vector Reconstruction
• Sparse Approximation Property and Stable Recovery of Sparse Signals From Noisy Measurements
• Total variation regularization of multi-material topology optimization
• A Probabilistic and RIPless Theory of Compressed Sensing
• Regularization and Variable Selection Via the Elastic Net
• An Efficient Proximity Point Algorithm for Total-Variation-Based Image Restoration

This page was built for publication: New regularization method and iteratively reweighted algorithm for sparse vector recovery