𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dykstra′s Alternating Projection Algorithm for Two Sets

✍ Scribed by H.H. Bauschke; J.M. Borwein

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
768 KB
Volume
79
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

✦ Synopsis

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 finitely many sets. (\quad: 1994) Academic Press. Inc.

📜 SIMILAR VOLUMES

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

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

Alternating-projection algorithms for op
Alternating-projection algorithms for operator-theoretic calculations
✍ Vrej Zarikian 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 290 KB

We show how alternating-projection algorithms can be used to solve a variety of operator-theoretic problems, including deciding complete positivity, computing completely bounded norms, computing norms of Schur multipliers, and matrix completion/approximation problems.

A Tree Projection Algorithm for Generati
A Tree Projection Algorithm for Generation of Frequent Item Sets
✍ Ramesh C. Agarwal; Charu C. Aggarwal; V.V.V. Prasad 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 355 KB

In this paper we propose algorithms for generation of frequent item sets by successive construction of the nodes of a lexicographic tree of item sets. We discuss different strategies in generation and traversal of the lexicographic tree such as breadth-first search, depth-first search, or a combinat

A two-grids/projection algorithm for obs
A two-grids/projection algorithm for obstacle problems
✍ A. Caboussat; R. Glowinski 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 481 KB

In order to emphasize the possible relatmn between discontinuous and continuous approximations on different meshes, a two-grids method for the resolution of parabolic variational mequality problems is presented. The numemcal methodology combines a time splitting algorithm to decouple a diffusion phe