Iterative algorithms with seminorm-induced oblique projections
type: Item
instance of: scholarly article
title: Iterative algorithms with seminorm-induced oblique projections
zbMATH Open document ID: 1047.90042
DOI: 10.1155/S108533750321201X
author: Yair Censor
author: T. Elfving
published in: Abstract and Applied Analysis
publication date: 2003-06-18T00:00:00Z
full work available at URL: https://eudml.org/doc/50964
review text: Summary: A definition of oblique projections onto closed convex sets that use seminorms induced by diagonal matrices which may have zeros on the diagonal is introduced. Existence and uniqueness of such projections are secured via directional affinity of the sets with respect to the diagonal matrices involved. A block-iterative algorithmic scheme for solving the convex feasibility problem, employing seminorm-induced oblique projections, is constructed and its convergence for the consistent case is established. The fully simultaneous algorithm converges also in the inconsistent case to the minimum of a certain proximity function.
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65J15
zbMATH DE Number: 1929989
zbMATH Keywords: convex feasibility problem
MaRDI profile type: Publication
OpenAlex ID: W1987275617
description: scientific article; zbMATH DE number 1929989