A finitely convergent ``row-action'' method for the convex feasibility problem
type: Item
instance of: scholarly article
title: A finitely convergent ``row-action'' method for the convex feasibility problem
zbMATH Open document ID: 0655.65085
DOI: 10.1007/BF01448368
published in: Applied Mathematics and Optimization
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 4070205
zbMATH Keywords: cyclic subgradient projection method
zbMATH Keywords: convex feasibility problem
zbMATH Keywords: row- action method
zbMATH Keywords: sparse systems of convex inequalities
zbMATH Keywords: linear rate of convergence
zbMATH Keywords: Slater condition
author: Álvaro Rodolfo De Pierro
author: Alfredo Iusem
reviewed by: Nada Djuranović-Miličić
MaRDI profile type: Publication
cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications
cites work: Cyclic subgradient projections
cites work: Q5520839
cites work: The method of projections for finding the common point of convex sets
cites work: The Relaxation Method for Linear Inequalities
cites work: Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
cites work: A primal-dual projection method for solving systems of linear inequalities
description: scientific article; zbMATH DE number 4070205