Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces

Dan Butnariu; Yair Censor

doi:10.1016/0377-0427(92)00123-Q

Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces

Dan Butnariu, Yair Censor

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We prove strong convergence of a class of block-iterative projection methods for finding a common point of a finite family of closed convex subsets in a Hilbert space.

Original language	English
Pages (from-to)	33-42
Number of pages	10
Journal	Journal of Computational and Applied Mathematics
Volume	53
Issue number	1
DOIs	https://doi.org/10.1016/0377-0427(92)00123-Q
State	Published - 29 Jul 1994

Bibliographical note

Funding Information:
* Corresponding author. e-mail: [email protected]. ’ The work of this author was supported by NIH Grant HL-28438, while visiting the Medical Image Processing Group (MIPG) at the Department of Radiology, Hospital of the University of Pennsylvania, Philadelphia, PA, United States.

Keywords

Block-iterative projection method
Boundedly compact set
Convex feasibility problem
Strong convergence
Uniformly convex set
Weak convergence

ASJC Scopus subject areas

Computational Mathematics
Applied Mathematics

Access to Document

10.1016/0377-0427(92)00123-Q

Cite this

@article{15d612c2a6db47cda30c65fbfd82f761,

title = "Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces",

abstract = "We prove strong convergence of a class of block-iterative projection methods for finding a common point of a finite family of closed convex subsets in a Hilbert space.",

keywords = "Block-iterative projection method, Boundedly compact set, Convex feasibility problem, Strong convergence, Uniformly convex set, Weak convergence",

author = "Dan Butnariu and Yair Censor",

note = "Funding Information: * Corresponding author. e-mail: [email protected]. {\textquoteright} The work of this author was supported by NIH Grant HL-28438, while visiting the Medical Image Processing Group (MIPG) at the Department of Radiology, Hospital of the University of Pennsylvania, Philadelphia, PA, United States.",

year = "1994",

month = jul,

day = "29",

doi = "10.1016/0377-0427(92)00123-Q",

language = "English",

volume = "53",

pages = "33--42",

journal = "Journal of Computational and Applied Mathematics",

issn = "0377-0427",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces

AU - Butnariu, Dan

AU - Censor, Yair

N1 - Funding Information: * Corresponding author. e-mail: [email protected]. ’ The work of this author was supported by NIH Grant HL-28438, while visiting the Medical Image Processing Group (MIPG) at the Department of Radiology, Hospital of the University of Pennsylvania, Philadelphia, PA, United States.

PY - 1994/7/29

Y1 - 1994/7/29

N2 - We prove strong convergence of a class of block-iterative projection methods for finding a common point of a finite family of closed convex subsets in a Hilbert space.

AB - We prove strong convergence of a class of block-iterative projection methods for finding a common point of a finite family of closed convex subsets in a Hilbert space.

KW - Block-iterative projection method

KW - Boundedly compact set

KW - Convex feasibility problem

KW - Strong convergence

KW - Uniformly convex set

KW - Weak convergence

UR - https://www.scopus.com/pages/publications/0002068851

U2 - 10.1016/0377-0427(92)00123-Q

DO - 10.1016/0377-0427(92)00123-Q

M3 - Article

AN - SCOPUS:0002068851

SN - 0377-0427

VL - 53

SP - 33

EP - 42

JO - Journal of Computational and Applied Mathematics

JF - Journal of Computational and Applied Mathematics

IS - 1

ER -

Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this