✦ LIBER ✦

Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints

✍ Scribed by Ingrid Daubechies; Massimo Fornasier; Ignace Loris

Publisher: SP Birkhäuser Verlag Boston
Year: 2008
Tongue: English
Weight: 574 KB
Volume: 14
Category: Article
ISSN: 1069-5869
DOI: 10.1007/s00041-008-9039-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An iterative thresholding algorithm for

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

✍ I. Daubechies; M. Defrise; C. De Mol 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 332 KB

A Tikhonov-based projection iteration fo

A Tikhonov-based projection iteration for nonlinear Ill-posed problems with sparsity constraints

✍ Ronny Ramlau; Gerd Teschke 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 343 KB

A supermemory gradient projection algori

A supermemory gradient projection algorithm for optimization problem with nonlinear constraints

✍ Ziyou Gao; Guoping He 📂 Article 📅 1992 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 429 KB

A projective method for linear programmi

A projective method for linear programming with box-type constraints

✍ G. Rinaldi 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 423 KB

On the gradient-projection method for so

On the gradient-projection method for solving the nonsymmetric linear complementarity problem

✍ Y. C. Cheng 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 573 KB

An interior feasible direction method wi

An interior feasible direction method with constraint projections for linear programming

✍ J.A. Snyman 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 745 KB

A new feasible direction method for linear programming problems is presented. The method is not boundary following. The method proceeds from a feasible interior point in a direction that improves the objective function until a point on a constraint surface is met. At this point searches are initiate