Sebastian Banert

According to our database, Sebastian Banert authored at least 11 papers between 2015 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

2026

The Chambolle-Pock method converges weakly with θ >1/2 and $\tau \sigma \Vert L\Vert ^2<4/(1+2\theta )$.

Sebastian Banert, Manu Upadhyaya, Pontus Giselsson

Optim. Lett., April, 2026

2025

Why the noise model matters: A performance gap in learned regularization.

Sebastian Banert, Christoph Brauer, Dirk A. Lorenz, Lionel Tondji

CoRR, October, 2025

Automated tight Lyapunov analysis for first-order methods.

Manu Upadhyaya, Sebastian Banert, Adrien B. Taylor, Pontus Giselsson

Math. Program., January, 2025

2024

Incorporating history and deviations in forward-backward splitting.

Hamed Sadeghi, Sebastian Banert, Pontus Giselsson

Numer. Algorithms, August, 2024

Frugal Splitting Operators: Representation, Minimal Lifting, and Convergence.

Martin Morin, Sebastian Banert, Pontus Giselsson

SIAM J. Optim., 2024

Accelerated Forward-Backward Optimization Using Deep Learning.

Sebastian Banert, Jevgenija Rudzusika, Ozan Öktem, Jonas Adler

SIAM J. Optim., 2024

2023

Circuit analysis using monotone+skew splitting.

Thomas Chaffey, Sebastian Banert, Pontus Giselsson, Richard Pates

Eur. J. Control, November, 2023

2021

Fixing and extending some recent results on the ADMM algorithm.

Sebastian Banert, Radu Ioan Bot, Ernö Robert Csetnek

Numer. Algorithms, 2021

2020

Data-Driven Nonsmooth Optimization.

Sebastian Banert, Axel Ringh, Jonas Adler, Johan Karlsson, Ozan Öktem

SIAM J. Optim., 2020

2019

A general double-proximal gradient algorithm for d.c. programming.

Sebastian Banert, Radu Ioan Bot

Math. Program., 2019

2015

Backward Penalty Schemes for Monotone Inclusion Problems.

Sebastian Banert, Radu Ioan Bot

J. Optim. Theory Appl., 2015