‎In this paper‎, ‎we propose two iterative methods for finding a common solution of a finite family of equilibrium problems ‎for pseudomonotone bifunctions‎. ‎The first is a parallel hybrid extragradient-cutting algorithm which is extended from the‎ ‎previously known one for variational inequalities to equilibrium problems‎. ‎The second is a new cyclic hybrid‎ ‎extragradient-cutting algorithm‎....

In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...

An unsupervised iterative N-dimensional point-set registration algorithm for unlabeled data (i.e., the correspondence between points is unknown) based on linear least squares proposed. The considers all possible point pairings and iteratively aligns two sets until number of pairs does not exceed maximum allowable one-to-one pairings.