Cyclic subgradient projections

Yair Censor; Arnold Lent

doi:10.1007/BF01585107

Cyclic subgradient projections

Yair Censor, Arnold Lent

Department of Mathematics

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

Abstract

A cyclically controlled method of subgradient projections (CSP) for the convex feasibility problem of solving convex inequalities is presented. The features of this method make it an efficient tool in handling huge and sparse problems. A particular application to an image reconstruction problem of emission computerized tomography is mentioned.

Original language	English
Pages (from-to)	233-235
Number of pages	3
Journal	Mathematical Programming
Volume	24
Issue number	1
DOIs	https://doi.org/10.1007/BF01585107
State	Published - Dec 1982

Keywords

Almost Cyclic
Convex Feasibility Problem
Image Reconstruction
Subgradient Projections

ASJC Scopus subject areas

Software
General Mathematics

Access to Document

10.1007/BF01585107

Cite this

@article{0d859943253c4d029d34a57b435e9f93,

title = "Cyclic subgradient projections",

abstract = "A cyclically controlled method of subgradient projections (CSP) for the convex feasibility problem of solving convex inequalities is presented. The features of this method make it an efficient tool in handling huge and sparse problems. A particular application to an image reconstruction problem of emission computerized tomography is mentioned.",

keywords = "Almost Cyclic, Convex Feasibility Problem, Image Reconstruction, Subgradient Projections",

author = "Yair Censor and Arnold Lent",

year = "1982",

month = dec,

doi = "10.1007/BF01585107",

language = "English",

volume = "24",

pages = "233--235",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "1",

}

TY - JOUR

T1 - Cyclic subgradient projections

AU - Censor, Yair

AU - Lent, Arnold

PY - 1982/12

Y1 - 1982/12

N2 - A cyclically controlled method of subgradient projections (CSP) for the convex feasibility problem of solving convex inequalities is presented. The features of this method make it an efficient tool in handling huge and sparse problems. A particular application to an image reconstruction problem of emission computerized tomography is mentioned.

AB - A cyclically controlled method of subgradient projections (CSP) for the convex feasibility problem of solving convex inequalities is presented. The features of this method make it an efficient tool in handling huge and sparse problems. A particular application to an image reconstruction problem of emission computerized tomography is mentioned.

KW - Almost Cyclic

KW - Convex Feasibility Problem

KW - Image Reconstruction

KW - Subgradient Projections

UR - http://www.scopus.com/inward/record.url?scp=34250232993&partnerID=8YFLogxK

U2 - 10.1007/BF01585107

DO - 10.1007/BF01585107

M3 - Article

AN - SCOPUS:34250232993

SN - 0025-5610

VL - 24

SP - 233

EP - 235

JO - Mathematical Programming

JF - Mathematical Programming

IS - 1

ER -

Cyclic subgradient projections

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this