Research Scholar, IGU, Meerpur, Rewari
Online published on 19 April, 2019.
The paper presents iterative method for solving convex feasibility problems where a convex combination of projections onto the given convex sets is discussed as the weights of the combination may vary from step to step. Here some special cases are block iterative processes in each iterative step a certain subfamily of the given family of convex sets is used. Such processes will be useful in various areas of applications including image reconstruction from projections, image restoration, and other fully discretized inversion problems.
