8 citations · 23 across the 18 of their papers we have counts for
19 papers
A -adic Recurrence for the Fixed Points of the Josephus Function
Yunier Bello-Cruz, Roy Quintero-Contreras
In the Josephus problem with stepsize four, the participants in a circle are eliminated one by one, every fourth person leaving, until a single survivor remains. A fixed point occu…
On the sharp linear convergence rate of the circumcentered--reflection method on subspaces
Yunier Bello-Cruz
For two subspaces $U,V\subseteq\RR^n$, the circumcentered--reflection method (CRM) of Behling, Bello-Cruz, and Santos~\citeyearpar{BBS2018} computes the projection onto u…
On the geometry of circumcentric directions of cones
Yunier Bello-Cruz
Behling, Bello-Cruz, Lara-Urdaneta, Oviedo, and Santos showed that the circumcentric direction of a finitely generated polyhedral cone $\KK\subset\RR^n$ admits an inscribed Euc…
The Method of Ellipcenters for Strongly Convex Functions
Yunier Bello-Cruz
The Method of Ellipcenters (ME), introduced in~\cite{ME2025} for strongly convex quadratic minimization, uses two gradient evaluations per iteration: one at the current iterate and…
Q-quadratic convergence of the centralized circumcentered-reflection method under a relative interior condition
Yunier Bello-Cruz
The centralized circumcentered-reflection method (\cCRM) of Behling, Bello-Cruz, Iusem, and Santos~\cite{Behling:2024} is known to converge superlinearly for the feasibility proble…
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…
Fixed Points of the Josephus Function via Fractional Base Expansions
Yunier Bello-Cruz, Roy Quintero-Contreras
In this paper, we investigate properties of the fixed point sequence of the Josephus function . First, we establish a connection between this sequence and the Chinese Remainde…
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…
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 Relative Inexact Proximal Gradient Method with an Explicit Linesearch
Yunier Bello-Cruz, Max L. N. Gonçalves, Jefferson G. Melo +1
This paper presents and investigates an inexact proximal gradient method for solving composite convex optimization problems characterized by an objective function composed of a sum…
A semi-smooth Newton method for general projection equations applied to the nearest correlation matrix problem
Nicolas F. Armijo, Yunier Bello-Cruz, Gabriel Haeser
In this paper, we extend and investigate the properties of the semi-smooth Newton method when applied to a general projection equation in finite dimensional spaces. We first presen…
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…
Analytical Study and Efficient Evaluation of the Josephus Function
Yunier Bello-Cruz, Roy Quintero-Contreras
A new approach to analyzing intrinsic properties of the Josephus function, , is presented in this paper. The linear structure between extreme points of is fully re…
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…
On the convergence of iterative schemes for solving a piecewise linear system of equations
Nicolas F. Armijo, Yunier Bello-Cruz, Gabriel Haeser
This paper is devoted to studying the global and finite convergence of the semi-smooth Newton method for solving a piecewise linear system that arises in cone-constrained quadratic…
On the centralization of the circumcentered-reflection method
Roger Behling, Yunier Bello-Cruz, Alfredo N. Iusem +1
This paper is devoted to deriving the first circumcenter iteration scheme that does not employ a product space reformulation for finding a point in the intersection of two closed c…
Circumcentering approximate reflections for solving the convex feasibility problem
Guilherme Araújo, Reza Arefidamghani, Roger Behling +3
The circumcentered-reflection method (CRM) has been applied for solving convex feasibility problems. CRM iterates by computing a circumcenter upon a composition of reflections with…
On Inexact Accelerated Proximal Gradient Methods with Relative Error Rules
Yunier Bello-Cruz, Max L. N. Gonçalves, Nathan Krislock
One of the most popular and important first-order iterations that provides optimal complexity of the classical proximal gradient method (PGM) is the "Fast Iterative Shrinkage/Thres…
On the Weak and Strong Convergence of a Conceptual Algorithm for Solving Three Operator Monotone Inclusions
Yunier Bello-Cruz, Oday Hazaimah
In this paper, a conceptual algorithm modifying the forward-backward-half-forward (FBHF) splitting method for solving three operator monotone inclusion problems is investigated. Th…