The L1-version of the Diliberto–Straus algorithm in C(T × S)

DOI10.1017/S0013091500022094zbMath0518.41032MaRDI QIDQ5902644

William A. Light, S. M. Holland

Publication date: 1984

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

tensor productDiliberto-Straus algorithmproximity mapsmetric selections

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items

On the von Neumann alternating algorithm in Hilbert space

Cites Work

• Unnamed Item
• Unnamed Item
• A course on optimization and best approximation
• On the approximation of a function of several variables by the sum of functions of fewer variables
• Some best-approximation theorems in tensor-product spaces
• Orthogonality and Linear Functionals in Normed Linear Spaces