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
β¦ LIBER β¦
Alternating-projection algorithms for operator-theoretic calculations
β Scribed by Vrej Zarikian
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 290 KB
- Volume
- 419
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
Dykstraβ²s Alternating Projection Algorit
β
H.H. Bauschke; J.M. Borwein
π
Article
π
1994
π
Elsevier Science
π
English
β 768 KB
A DFT based alternating projection algor
β
Gaurav Sharma; V.U. Reddy
π
Article
π
1994
π
Elsevier Science
π
English
β 749 KB
On projectional-solvability and the Fred
β
W. V. Petryshyn
π
Article
π
1968
π
Springer
π
English
β 786 KB
Treatment of symmetry in MO calculations
β
H. H. JaffΓ©
π
Article
π
1988
π
John Wiley and Sons
π
English
β 404 KB
This article describes the numerical application of projection operators to restore the symmetry of molecular orbitals in self-consistent field (SCF) calculations when the symmetry is lost because of degeneracy or near degeneracy. The application of projection operators is particularly useful in cas
Fast initialization procedure of the alt
β
Seong Keun Oh; Chong Kwan Un
π
Article
π
1991
π
Elsevier Science
π
English
β 501 KB
On an iterative projection algorithm for
β
V.P. Tanana
π
Article
π
1977
π
Elsevier Science
β 596 KB