A finitely convergent ``row-action'' method for the convex feasibility problem (Q1109529)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A finitely convergent ``row-action method for the convex feasibility problem |
scientific article; zbMATH DE number 4070205
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A finitely convergent ``row-action'' method for the convex feasibility problem |
scientific article; zbMATH DE number 4070205 |
Statements
A finitely convergent ``row-action'' method for the convex feasibility problem (English)
0 references
1988
0 references
The authors present a modification of the cyclic subgradient projection (MCSP) method by \textit{Y. Censor} and \textit{A. Lenz} [Math. Programming 24, 233-235 (1982; Zbl 0491.90077)] which solves the convex feasibility problem in a finite number of steps when a Slater type condition holds. The MCSP method is a row-action method useful for handling huge and sparse systems of convex inequalities. A linear rate of convergence for the cyclic subgradient projection method is proved assuming the presence of the Slater condition, too.
0 references
cyclic subgradient projection method
0 references
convex feasibility problem
0 references
row- action method
0 references
sparse systems of convex inequalities
0 references
linear rate of convergence
0 references
Slater condition
0 references
