✦ LIBER ✦

Iteratively reweighted least squares minimization for sparse recovery

✍ Scribed by Ingrid Daubechies; Ronald DeVore; Massimo Fornasier; C. Si̇nan Güntürk

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 385 KB
Volume: 63
Category: Article
ISSN: 0010-3640
DOI: 10.1002/cpa.20303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improving uncertainty analysis in kineti

Improving uncertainty analysis in kinetic evaluations using iteratively reweighted least squares

✍ Zhenglei Gao; John W. Green; Jan Vanderborght; Walter Schmitt 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB

Matrix stretching for sparse least squar

Matrix stretching for sparse least squares problems

✍ Mikael Adlers; Åke Björck 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB

For linear least squares problems min x Ax -b 2 , where A is sparse except for a few dense rows, a straightforward application of Cholesky or QR factorization will lead to catastrophic fill in the factor R. We consider handling such problems by a matrix stretching technique, where the dense rows ar

A Levenberg-Marquardt iterative solver f

A Levenberg-Marquardt iterative solver for least-squares problems

✍ Ho, H. W. ;Wong, S. C. 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

An iterative penalty method for the leas

An iterative penalty method for the least squares solution of boundary value problems

✍ D. G. Zeitoun; J. P. Laible; G. F. Pinder 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 426 KB 👁 2 views

This article is concerned with iterative techniques for linear systems of equations arising from a least squares formulation of boundary value problems. In its classical form, the solution of the least squares method is obtained by solving the traditional normal equation. However, for nonsmooth boun