The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery
From MaRDI portal
Publication:4579333
DOI10.1109/TSP.2014.2330349zbMath1394.94114arXiv1211.7089OpenAlexW2074577749MaRDI QIDQ4579333
Publication date: 22 August 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.7089
Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (9)
A survey on some recent developments of alternating direction method of multipliers ⋮ On high-dimensional Poisson models with measurement error: hypothesis testing for nonlinear nonconvex optimization ⋮ A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems ⋮ A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems ⋮ Weak fault detection of tapered rolling bearing based on penalty regularization approach ⋮ Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization ⋮ Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem ⋮ Unnamed Item ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
This page was built for publication: The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery
