14 citations · 56 across the 13 of their papers we have counts for
14 papers
On circumcentered direct methods for monotone variational inequality problems
Roger Behling, Yunier Bello-Cruz, Alfredo Iusem +2
Circumcentered techniques have been shown to significantly accelerate projection-based methods for convex feasibility problems. Motivated by this success, we propose two direct met…
Asymptotic Convergence Analysis of High-Order Proximal-Point Methods Beyond Sublinear Rates
Masoud Ahookhosh, Alfredo Iusem, Alireza Kabgani +1
This paper investigates the asymptotic convergence behavior of the high-order proximal-point algorithm (HiPPA) to global minimizers, extending existing analyses beyond sublinear co…
Univariate representations of solutions to generic polynomial complementarity problems
Vu Trung Hieu, Alfredo Noel Iusem, Paul Hugo Schmölling +1
By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of t…
A finitely convergent circumcenter method for the Convex Feasibility Problem
Roger Behling, Yunier Bello-Cruz, Alfredo Iusem +2
In this paper, we present a variant of the circumcenter method for the Convex Feasibility Problem (CFP), ensuring finite convergence under a Slater assumption. The method replaces…
A successive centralized circumcenter reflection method for the convex feasibility problem
Roger Behling, Yunier Bello-Cruz, Alfredo Iusem +2
In this paper we present the successive centralization of the circumcenter reflection scheme with several control sequences for solving the convex feasibility problem in Euclidean…
A circumcentered-reflection method for finding common fixed points of firmly nonexpansive operators
Reza Arefidamghani, Roger Behling, Alfredo N. Iusem +1
The circumcentered-reflection method (CRM) has been recently proposed as a methodology for accelerating several algorithms for solving the Convex Feasibility Problem (CFP), equival…