6 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…
Bidirectional SDDP with dimension-free complexity for solving strongly convex stochastic dynamic programming equations
Pablo Barros, Vincent Guigues
We analyze the complexity of Bidirectional Stochastic Dual Dynamic Programming (BSDDP) algorithm applied to multistage stochastic optimization problems with strongly convex cost fu…
Dimension-Free Complexity Guarantees for Dual Dynamic Programming
Pablo Barros, Vincent Guigues, Jiaming Liang +1
This paper studies the complexity of a dual dynamic programming (DDP) method for solving a class of convex optimization problems with linear coupling constraints. Existing complexi…
Deep Centralization for the Circumcentered Reflection Method
Pablo Barros
We introduce the extended centralized circumcentered reflection method (ecCRM), a framework for two-set convex feasibility that encompasses the classical centralized CRM (cCRM) of…
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…
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…