Iterative algorithms with seminorm‐induced oblique projections

Yair Censor and Tommy Elfving

Abstract and Applied Analysis, 2003, vol. 2003, issue 7, 387-406

Abstract: 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.

Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/S108533750321201X

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2003:y:2003:i:7:p:387-406

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().