A unifying analysis of projected gradient descent for \(\ell_p\)-constrained least squares

DOI10.1016/j.acha.2012.07.004zbMath1268.65054arXiv1107.4623OpenAlexW3098600672MaRDI QIDQ1948598

B. Raj, Sohail Bahmani

Publication date: 24 April 2013

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

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

zbMATH Keywords

convergencesparsitycompressed sensingrestricted isometry propertyunderdetermined linear systemssparse least squares problemsprojected gradient descent algorithm

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (5)

A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems ⋮ Stable recovery of sparse signals via \(\ell_p\)-minimization ⋮ Convergence of projected Landweber iteration for matrix rank minimization ⋮ Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery ⋮ Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints

This page was built for publication: A unifying analysis of projected gradient descent for \(\ell_p\)-constrained least squares