RELAXED OUTER PROJECTIONS, WEIGHTED AVERAGES AND CONVEX FEASIBILITY

被引：54

作者：

FLAM, SD

ZOWE, J

机构：

[1] UNIV BERGEN,DEPT ECON,N-5008 BERGEN,NORWAY

[2] UNIV BAYREUTH,DEPT MATH,W-8580 BAYREUTH,GERMANY

来源：

BIT | 1990年 / 30卷 / 02期

关键词：

Block-iterations; Convex Feasibility Problem; F.2.2; I.3.5; Outer Projections; Relaxations; Row-action Methods;

D O I：

10.1007/BF02017349

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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. © 1990 BIT Foundations.

引用

页码：289 / 300

页数：12

共 24 条

[1] THE RELAXATION METHOD FOR LINEAR INEQUALITIES [J].