2 citations · 2 across the 9 of their papers we have counts for
11 papers
Regularized extragradient method for structured bilevel optimization in continuous and discrete time
Radu Ioan Bot, Enis Chenchene, David Alexander Hulett
In a real Hilbert space, we study a bilevel optimization problem that consists in minimizing an outer convex function over the zero set of a maximally monotone operator. In the smo…
Accelerating Diagonal Methods for Bilevel Optimization: Unified Convergence via Continuous-Time Dynamics
Radu Ioan Boţ, Enis Chenchene, Ernö Robert Csetnek +1
We analyze fast diagonal methods for simple bilevel programs. Guided by the analysis of the corresponding continuous-time dynamics, we provide a unified convergence analysis under…
Splitting the Forward-Backward Algorithm: A Full Characterization
Anton Åkerman, Enis Chenchene, Pontus Giselsson +1
We study frugal splitting algorithms with minimal lifting for solving monotone inclusion problems involving sums of maximal monotone and cocoercive operators. Building on a foundat…
Fast Krasnoselskii-Mann Method with Overrelaxation and Preconditioners
Radu I. Boţ, Enis Chenchene, Jalal M. Fadili
We study accelerated Krasnoselskii-Mann-type methods with preconditioners in both continuous and discrete time. From a continuous-time model, we derive a generalized fast Krasnosel…
Extra-Gradient Method with Flexible Anchoring: Strong Convergence and Fast Residual Decay
Radu Ioan Boţ, Enis Chenchene
In this paper, we introduce a novel Extra-Gradient method with anchor term governed by general parameters. Our method is derived from an explicit discretization of a Tikhonov-regul…
Constrained Consensus-Based Optimization and Numerical Heuristics for the Few Particle Regime
Jonas Beddrich, Enis Chenchene, Massimo Fornasier +2
Consensus-based optimization (CBO) is a versatile multi-particle optimization method for performing nonconvex and nonsmooth global optimizations in high dimensions. Proofs of globa…
A consensus-based algorithm for non-convex multiplayer games
Enis Chenchene, Hui Huang, Jinniao Qiu
In this paper, we present a novel consensus-based zeroth-order algorithm tailored for non-convex multiplayer games. The proposed method leverages a metaheuristic approach using con…
Wasserstein medians: robustness, PDE characterization and numerics
Guillaume Carlier, Enis Chenchene, Katharina Eichinger
We investigate the notion of Wasserstein median as an alternative to the Wasserstein barycenter, which has become popular but may be sensitive to outliers. In terms of robustness t…
Graph and distributed extensions of the Douglas-Rachford method
Kristian Bredies, Enis Chenchene, Emanuele Naldi
In this paper, we propose several graph-based extensions of the Douglas-Rachford splitting (DRS) method to solve monotone inclusion problems involving the sum of maximal monoto…
A hybrid proximal generalized conditional gradient method and application to total variation parameter learning
Kristian Bredies, Enis Chenchene, Alireza Hosseini
In this paper we present a new method for solving optimization problems involving the sum of two proper, convex, lower semicontinuous functions, one of which has Lipschitz continuo…
Degenerate Preconditioned Proximal Point algorithms
Kristian Bredies, Enis Chenchene, Dirk A. Lorenz +1
In this paper we describe a systematic procedure to analyze the convergence of degenerate preconditioned proximal point algorithms. We establish weak convergence results under mild…