The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\)

DOI10.1016/0022-1236(92)90093-XzbMath0761.65041MaRDI QIDQ1188107

Daniel Wulbert, Allan Pinkus

Publication date: 13 August 1992

Published in: Journal of Functional Analysis (Search for Journal in Brave)

zbMATH Keywords

convergencenormed linear spacecyclic coordinate algorithmDiliberto-Strauss algorithmmulti-dimensional von Neumann alternating direction search algorithm

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• An \(\epsilon\)-median polish algorithm
• Approximation theory in tensor product spaces
• Unicity subspaces in \(L^ 1\)-approximation
• Descent methods in smooth, rotund spaces with applications to approximation in L\(^p\)
• Practical and mathematical aspects of the problem of reconstructing objects from radiographs
• On $L_1 $ Approximation I: Computation for Continuous Functions and Continuous Dependence
• Convergence Conditions for Nonlinear Programming Algorithms
• The Semigroup Property for the Birth and Death Process.

This page was built for publication: The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\)