caa a22 4500 465821529 CHVBK 20180323112137.0 cr unu---uuuuu 170327e19900601xx s 000 0 eng 10.1007/BF02017349 doi (NATIONALLICENCE)springer-10.1007/BF02017349 Relaxed outer projections, weighted averages and convex feasibility [Elektronische Daten] [Sjur Flåm, Jochem Zowe] A new algorithmic scheme is proposed for finding a common point of finitely many closed convex sets. The scheme uses weighted averages (convex combinations) of relaxed projections onto approximating halfspaces. By varying the weights we generalize Cimmino's and Auslender's methods as well as more recent versions developed by Iusem & De Pierro and Aharoni & Censor. Our approach offers great computational flexibility and encompasses a wide variety of known algorithms as special instances. Also, since it is "block-iterative”, it lends itself to parallel processing. BIT Foundations, 1990 F.2.2 nationallicence I.3.5 nationallicence Outer Projections nationallicence Relaxations nationallicence Convex Feasibility Problem nationallicence Row-action Methods nationallicence Block-iterations nationallicence Flåm Sjur Dep. of Economics, Univ. of Bergen, N-5008, Bergen, Norway aut Zowe Jochem Dep. of Economics, Univ. of Bergen, N-5008, Bergen, Norway aut BIT Kluwer Academic Publishers 30/2(1990-06-01), 289-300 0006-3835 30:2<289 1990 30 10543 https://doi.org/10.1007/BF02017349 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02017349 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Flåm Sjur Dep. of Economics, Univ. of Bergen, N-5008, Bergen, Norway aut NATIONALLICENCE 700 1- Zowe Jochem Dep. of Economics, Univ. of Bergen, N-5008, Bergen, Norway aut NATIONALLICENCE 773 0- BIT Kluwer Academic Publishers 30/2(1990-06-01), 289-300 0006-3835 30:2<289 1990 30 10543 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer