On the von Neumann alternating algorithm in Hilbert space

General theory of numerical analysis in abstract spaces (65J05) Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Recommendations

scientific article; zbMATH DE number 4039146
The Diliberto-Straus algorithm in \(L_ 1(X\times Y)\)
The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\)
scientific article; zbMATH DE number 853813
On the rate of convergence of greedy algorithms.
Some remarks on greedy algorithms
Rate of convergence of the discrete Pólya algorithm
scientific article; zbMATH DE number 3919635
scientific article; zbMATH DE number 6325423

Cites work

scientific article; zbMATH DE number 3160457 (Why is no real title available?)
scientific article; zbMATH DE number 3671029 (Why is no real title available?)
scientific article; zbMATH DE number 3507398 (Why is no real title available?)
scientific article; zbMATH DE number 3222351 (Why is no real title available?)
scientific article; zbMATH DE number 3421317 (Why is no real title available?)
Convergence of the diliberto-straus algorithm in L₁(XxY)
Functional Operators (AM-22), Volume 2
On the approximation of a bivariate function by the sum of univariate functions
On the approximation of a function of several variables by the sum of functions of fewer variables
The L₁-version of the Diliberto–Straus algorithm in C(T × S)
Two extensions of the alternating algorithm of von Neumann

Cited in

(24)

The Alternating Algorithm in Uniformly Convex Spaces
Accelerating the convergence of the method of alternating projections
A variational approach to the alternating projections method
On the convergence of von Neumann's alternating projection algorithm for two sets
Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
Analysis of the parallel Schwarz method for growing chains of fixed-sized subdomains. III.
Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
Where there's a Will there's a way -- the research of Will Light
Kaczmarz algorithm in Hilbert space
Polynomial estimates for the method of cyclic projections in Hilbert spaces
Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems
The Convergence of an Algorithm for Finding the Distance between a Ball in a Subspace and a Sum of Subspaces
The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\)
On weak * closedness, coerciveness, and inf-sup theorems
The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
On the rate of convergence of the alternating projection method in finite dimensional spaces
A learning-enhanced projection method for solving convex feasibility problems
A new way of computing the orthogonal projection onto the intersection of two hyperplanes in a finite-dimensional Hilbert space
Characterizing arbitrarily slow convergence in the method of alternating projections
Two extensions of the alternating algorithm of von Neumann
Eine Verallgemeinerung des Ritz-Prozesses
Error bounds for the method of alternating projections
The rate of convergence for the method of alternating projections. II

This page was built for publication: On the von Neumann alternating algorithm in Hilbert space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822209)