9 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…
The Method of Ellipcenters for strongly convex minimization
Roger Behling, Ramyro Correa, Eduarda Ferreira +1
This work is about ME, the Method of Ellipcenters. ME was recently introduced by these very authors as a first order accelerated scheme for unconstrained minimization. Its iterates…
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…
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 F…
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…
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…