✦ LIBER ✦

Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization

✍ Scribed by Donald Goldfarb; Shiqian Ma

Publisher: Springer-Verlag
Year: 2011
Tongue: English
Weight: 984 KB
Volume: 11
Category: Article
ISSN: 1615-3375
DOI: 10.1007/s10208-011-9084-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fixed point and Bregman iterative method

Fixed point and Bregman iterative methods for matrix rank minimization

✍ Shiqian Ma; Donald Goldfarb; Lifeng Chen 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 566 KB

Convergence of LR algorithm for a one-po

Convergence of LR algorithm for a one-point spectrum tridiagonal matrix

✍ Carla Ferreira; Beresford Parlett 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 197 KB

A globally convergent algorithm for comp

A globally convergent algorithm for computing fixed points of C2 maps

✍ Layne T. Watson 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 805 KB

Strong convergence theorems by a new hyb

Strong convergence theorems by a new hybrid projection algorithm for fixed point problems and equilibrium problems of two relatively quasi-nonexpansive mappings

✍ Kriengsak Wattanawitoon; Poom Kumam 📂 Article 📅 2009 🏛 Elsevier 🌐 English ⚖ 569 KB

Corrigendum to: “Strong convergence theo

Corrigendum to: “Strong convergence theorems by a new hybrid projection algorithm for fixed point problems and equilibrium problems of two relatively quasi-nonexpansive mappings” [Nonlinear Anal. Hybrid Syst. 3 (2009) 11–20]

✍ Kriengsak Wattanawitoon; Poom Kumam 📂 Article 📅 2009 🏛 Elsevier 🌐 English ⚖ 153 KB

The authors regret that the above-referenced paper contains a number of misprints. In the statement of Theorem 3.1 (Eq. (3.1)) the condition C n+1 is incorrect. In fact, the set C n+1 in Theorem 3.1 should be replaced by the following one: The proof on page 15 line 5 should be inserted with the fol