Weaker hypotheses for the general projection algorithm with corrections
Abstract
In an earlier paper [J. of Appl. Math. and Informatics, 29(3-4)(2011), 697-712] we proposed a general projection-type algorithm with corrections and proved its convergence under a set of special assumptions. In this paper we prove convergence of this algorithm under a much weaker set of assumptions. This new framework gives us the possibility to obtain as a particular case of our method the two-step algorithm analysed in [B I T, 38(2)(1998), 275-282].
Language: English
Page range: 9 - 16
Submitted on: Oct 1, 2014
Accepted on: Oct 1, 2014
Published on: Apr 22, 2017
Published by: Ovidius University of Constanta
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year
Related subjects:
© 2017 Alexandru Bobe, Aurelian Nicola, Constantin Popa, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.