A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets
From MaRDI portal
Publication:4785796
DOI10.1137/S0036142900367557zbMath1055.41021OpenAlexW1969660923MaRDI QIDQ4785796
Publication date: 5 January 2003
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0036142900367557
Linear inequalities of matrices (15A39) Iterative numerical methods for linear systems (65F10) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)
Related Items (4)
Fundamentals of cone regression ⋮ How good are projection methods for convex feasibility problems? ⋮ A convergent algorithm for a generalized multivariate isotonic regression problem ⋮ An acceleration scheme for Dykstra's algorithm
This page was built for publication: A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets