Two generalizations of Dykstra's cyclic projections algorithm

Fecha:	1997
Resumen:	Dykstra's cyclic projections algorithm allows one to compute best approximations to any pointx in a Hilbert space from the intersection C = (intersection)^r_1 C_i of a finite number of closed convex sets C_i, by reducing it to a sequence of best approximation problems from the individual sets C_i. Here we present two generalizations of this algorithm. First we allow the number of sets C_i to be infinite rather than finite; secondly, we allow a random, rather than cyclic, ordering of the sets C_i. .
Derechos:	Tots els drets reservats.
Lengua:	Anglès
Documento:	Article ; recerca ; Versió publicada
Materia:	Dykstra's algorithm ; Cyclic projections ; Successive approximation ; Convex feasibility ; Alternating projections ; Best approximation ; Hildreth's algorithm ; Finite element method
Publicado en:	Mathematical Programming, vol. 77 n. 3 (1997) p. 335-355, ISSN 0025-5610

21 p, 759.1 KB

Acceso restringido a la UAB

Registro creado el 2006-03-13, última modificación el 2023-06-03