4 papers · 1 filter
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…
On the Circumcentered-Reflection Method for the Convex Feasibility Problem
Roger Behling, Yunier Bello-Cruz, Luiz-Rafael Santos
The ancient concept of circumcenter has recently given birth to the Circumcentered-Reflection method (CRM). CRM was first employed to solve best approximation problems involving af…
The Block-wise Circumcentered-Reflection Method
Roger Behling, J. -Yunier Bello-Cruz, Luiz-Rafael Santos
The elementary Euclidean concept of circumcenter has recently been employed to improve two aspects of the classical Douglas--Rachford method for projecting onto the intersection of…
On a conjecture in second-order optimality conditions
R. Behling, G. Haeser, A. Ramos +1
In this paper we deal with optimality conditions that can be verified by a nonlinear optimization algorithm, where only a single Lagrange multiplier is avaliable. In particular, we…