37 citations · 167 across the 19 of their papers we have counts for
20 papers
New operator designs for Halpern iterations with explicit rates under Hölder error bounds
Pablo Barros, Vincent Guigues, Roger Behling +1
We investigate the asymptotic behavior of Halpern-type iterations applied to quasi-nonexpansive operators arising in best approximation problems over the intersection of finitely m…
Basis pursuit by inconsistent alternating projections
Roger Behling, Yunier Bello-Cruz, Luiz-Rafael Santos +1
Basis pursuit is the problem of finding a vector with smallest -norm among the solutions of a given linear system of equations. It is a well-known convex relaxation of the…
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…
Parallelizing the Circumcentered-Reflection Method
Pablo Barros, Roger Behling, Vincent Guigues +1
This paper introduces the Parallelized Circumcentered Reflection Method (P-CRM), a circumcentric approach that parallelizes the Circumcentered Reflection Method (CRM) for solving C…
Fejér* monotonicity in optimization algorithms
Roger Behling, Yunier Bello-Cruz, Alfredo Noel Iusem +2
Fejér monotonicity is a well-established property often observed in sequences generated by optimization algorithms. In this paper, we study an extension of this property, called Fe…
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…