collaborators

10 papers

math.NA2026

A localized consensus-based sampling algorithm

Arne Bouillon, Alexander Bodard, Panagiotis Patrinos +2

We propose a localized consensus-based method for sampling from non-Gaussian distributions, a task that frequently arises when solving Bayesian inverse problems. Our method arises…

math.OC2026

Newton methods beyond Hessian Lipschitz continuity: A nonlinear preconditioning approach

Alexander Bodard, Panagiotis Patrinos

Newton-type methods are typically analyzed under Lipschitz continuity of the Hessian, an assumption that can fail for objectives with higher-order or polynomial growth. We introduc…

math.OC2026

Nonlinearly preconditioned gradient flows

Konstantinos Oikonomidis, Alexander Bodard, Jan Quan +1

We study a continuous-time dynamical system which arises as the limit of a broad class of nonlinearly preconditioned gradient methods. Under mild assumptions, we establish existenc…

math.OC2026

PANOC-lite: A simpler and more efficient algorithm for composite minimization

Alexander Bodard, Pieter Pas, Andreas Themelis +1

This work introduces a simple and efficient linesearch method for composite minimization that accelerates proximal-gradient iterations with fast Newton-type directions. Our algorit…

math.OC2025

EM++: A parameter learning framework for stochastic switching systems

Renzi Wang, Alexander Bodard, Mathijs Schuurmans +1

This paper proposes a general switching dynamical system model, and a custom majorization-minimization-based algorithm EM++ for identifying its parameters. For certain families of…

math.OC2025

Scaled relative graphs for pairs of operators beyond classical monotonicity

Jan Quan, Alexander Bodard, Konstantinos Oikonomidis +1

We introduce a generalization of the scaled relative graph (SRG) to pairs of operators, enabling the visualization of their relative incremental properties. This novel SRG framewor…