𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Robust Stopping Criteria for Dykstra's Algorithm

✍ Scribed by Birgin, Ernesto G.; Raydan, Marcos

Book ID
118189881
Publisher
Society for Industrial and Applied Mathematics
Year
2005
Tongue
English
Weight
299 KB
Volume
26
Category
Article
ISSN
1064-8275

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dykstraβ€²s Alternating Projection Algorit
Dykstraβ€²s Alternating Projection Algorithm for Two Sets
✍ H.H. Bauschke; J.M. Borwein πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 768 KB

We analyze Dykstra's algorithm for two arbitrary closed convex sets in a Hilbert space. Our technique also applies to von Neumann's algorithm. Various convergence results follow. An example allows one to compare qualitative and quantitative behaviour of the two algorithms. We discuss the case of fin

Dykstra's algorithm for constrained leas
Dykstra's algorithm for constrained least-squares rectangular matrix problems
✍ R. Escalante; M. Raydan πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 404 KB

ln a recent paper, the authors applied Dykstra's alternating projection algorithm to solve constrained least-squares n x n matrix problems. We extend these results in two different directions. First, we make use of the singular value decomposition to solve now constrained leastsquares rectangular m

Dykstra's Algorithm for a Constrained Le
Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
✍ RenΓ© Escalante; Marcos Raydan πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 577 KB

We apply Dykstra's alternating projection algorithm to the constrained least-squares matrix problem that arises naturally in statistics and mathematical economics. In particular, we are concerned with the problem of finding the closest symmetric positive definite bounded and patterned matrix, in the

Timing Models and Local Stopping Criteri
Timing Models and Local Stopping Criteria for Asynchronous Iterative Algorithms
✍ Kostas Blathras; Daniel B. Szyld; Yuan Shi πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 889 KB

Asynchronous iterative algorithms can reduce much of the data dependencies associated with synchronization barriers. The reported study investigates the potentials of asynchronous iterative algorithms by quantifying the critical parallel processing factors. Specifically, a time complexity-based anal