ON THE BEHAVIOR OF SUBGRADIENT PROJECTIONS METHODS FOR CONVEX FEASIBILITY PROBLEMS IN EUCLIDEAN SPACES

被引：25

作者：

Butnariu, Dan ^{[1
]}

Censor, Yair ^{[1
]}

Gurfil, Pini ^{[2
]}

Hadar, Ethan ^{[3
]}

机构：

[1] Univ Haifa, Dept Math, IL-31905 Haifa, Israel

[2] Technion Israel Inst Technol, Fac Aerosp Engn, IL-32000 Haifa, Israel

[3] Comp Associates Int Inc, CA Labs, IL-20692 Yokneam, Israel

来源：

SIAM JOURNAL ON OPTIMIZATION | 2008年 / 19卷 / 02期

基金：

以色列科学基金会; 美国国家卫生研究院;

关键词：

convex feasibility problems; projection method; computational algorithms;

D O I：

10.1137/070689127

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation parameters in a specific self-adapting manner. This strategy leaves enough user flexibility but gives a mathematical guarantee for the algorithm's behavior in the inconsistent case. We present the numerical results of computational experiments that illustrate the computational advantage of the new method.

引用

页码：786 / 807

页数：22

共 38 条

[1]

[Anonymous], 1993, CONVEX FUNCTIONS

[2]

Bauschke H.H., 1997, CONT MATH, V204, P1

[3] The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space [J].