activity
20212025
most citedAutomated tight Lyapunov analysis for first-order methods

8 citations · 14 across the 9 of their papers we have counts for

collaborators

9 papers

math.OC2025

The AutoLyap software suite for computer-assisted Lyapunov analyses of first-order methods

Manu Upadhyaya, Shuvomoy Das Gupta, Adrien B. Taylor +2

We introduce AutoLyap, a software suite that assists with Lyapunov analyses of a wide class of first-order methods for structured optimization and inclusion problems. Lyapunov anal…

math.OC2023★ 1 cited

The Chambolle--Pock method converges weakly with and

Sebastian Banert, Manu Upadhyaya, Pontus Giselsson

The Chambolle--Pock method is a versatile three-parameter algorithm designed to solve a broad class of composite convex optimization problems, which encompass two proper, lower sem…

math.OC2023★ 8 cited

Automated tight Lyapunov analysis for first-order methods

Manu Upadhyaya, Sebastian Banert, Adrien B. Taylor +1

We present a methodology for establishing the existence of quadratic Lyapunov inequalities for a wide range of first-order methods used to solve convex optimization problems. In pa…

math.OC2022★ 5 cited

Circuit Analysis using Monotone+Skew Splitting

Thomas Chaffey, Sebastian Banert, Pontus Giselsson +1

It is shown that the behavior of an -port circuit of maximal monotone elements can be expressed as a zero of the sum of a maximal monotone operator containing the circuit elemen…

math.OC2022

Incorporating History and Deviations in Forward--Backward Splitting

Hamed Sadeghi, Sebastian Banert, Pontus Giselsson

We propose a variation of the forward--backward splitting method for solving structured monotone inclusions. Our method integrates past iterates and two deviation vectors into the…

math.OC2022

Frugal Splitting Operators: Representation, Minimal Lifting, and Convergence

Martin Morin, Sebastian Banert, Pontus Giselsson

We investigate frugal splitting operators for finite sum monotone inclusion problems. These operators utilize exactly one direct or resolvent evaluation of each operator of the sum…

math.OC2022

DWIFOB: A Dynamically Weighted Inertial Forward-Backward Algorithm for Monotone Inclusions

Hamed Sadeghi, Sebastian Banert, Pontus Giselsson

We propose a novel dynamically weighted inertial forward-backward algorithm (DWIFOB) for solving structured monotone inclusion problems. The scheme exploits the globally convergent…

math.OC2021

Forward--Backward Splitting with Deviations for Monotone Inclusions

Hamed Sadeghi, Sebastian Banert, Pontus Giselsson

We propose and study a weakly convergent variant of the forward--backward algorithm for solving structured monotone inclusion problems. Our algorithm features a per-iteration devia…

math.OC2021

Nonlinear Forward-Backward Splitting with Momentum Correction

Martin Morin, Sebastian Banert, Pontus Giselsson

The nonlinear, or warped, resolvent recently explored by Giselsson and Bùi-Combettes has been used to model a large set of existing and new monotone inclusion algorithms. To establ…