The location problem is to find a point M whose sum of weighted distances from m vertices in p-dimensional Euclidean space is a minimum. The bestknown algorithm for solving the location problem is an ...
In this paper, a novel algorithm, called parallel inertial S-iteration forward-backward algorithm (PISFBA) is proposed for finding a common fixed point of a countable family of nonexpansive mappings ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback