activity
20172026
most citedA successive centralized circumcenter reflection method for the convex feasibility problem

5 citations · 7 across the 12 of their papers we have counts for

collaborators
Showing 2025Show all

5 papers · 1 filter

math.OC2025

Introducing the method of ellipcenters, a new first order technique for unconstrained optimization

Roger Behling, Ramyro Aquines Correa, Eduarda Ferreira Zanatta +1

In this paper, we introduce the Method of Ellipcenters (ME) for unconstrained minimization. At the cost of two gradients per iteration and a line search, we compute the next iterat…

math.OC2025

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…

math.OC2025

Parallel Polyhedral Projection Method for the Convex Feasibility Problem

Pablo Barros, Roger Behling, Vincent Guigues

In this paper, we introduce and study the Parallel Polyhedral Projection Method (3PM) and the Approximate Parallel Polyhedral Projection Method (A3PM) for finding a point in the in…

math.OC2025

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…

math.OC2025

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…