A comparative analysis of the convergence regions for different parallel affine projection algortihms
DOI:
https://doi.org/10.24193/subbmath.2018.3.11Abstract
This paper analysis the dimension and the shape of conver-
gence regions of three algorithms used to solve the convex feasibility prob-
lem in bidimensional space: the Parallel Projection Method (PPM), the
classical Extrapolated Method of Parallel Projections (EMOPP) and a mod-
ied version of EMOPP.
Downloads
Additional Files
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Transfer of copyright agreement: When the article is accepted for publication, the authors and the representative of the coauthors, hereby agree to transfer to Studia Universitatis Babeș-Bolyai Mathematica all rights, including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the authors specifically retain: the authors can use the material however they want as long as it fits the NC ND terms of the license. The authors have all rights for reuse according to the license.
