| Date: |
1997 |
| Abstract: |
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. . |
| Rights: |
Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.  |
| Language: |
Anglès |
| Document: |
Article ; recerca ; Versió publicada |
| Subject: |
Dykstra's algorithm ;
Cyclic projections ;
Successive approximation ;
Convex feasibility ;
Alternating projections ;
Best approximation ;
Hildreth's algorithm ;
Finite element method |
| Published in: |
Mathematical Programming, vol. 77 n. 3 (1997) p. 335-355, ISSN 0025-5610 |
guest ::
UAB restricted access
