Springe zum Hauptinhalt

Forschung

Publikationen

 

S. Bitterlich: Numerical splitting methods for nonsmooth convex optimization problems, https://nbn-resolving.org/urn:nbn:de:bsz:ch1-qucosa2-883961.

S. Bitterlich, S.-M. Grad: Stochastic incremental mirror descent algorithms with Nesterov smoothing, Numerical Algorithms 95, 351–382 (2024).

S. Bitterlich, E.R. Csetnek, G. Wanka: A Dynamical Approach to Two-Block Seperable Convex Optimization Problems with Linear Constraints, Numerical Functional Analysis and Optimization 42(1), 1-38 (2021).

S. Bitterlich, R.I. Boţ, E.R. Csetnek, G. Wanka: The Proximal Alternating Minimization Algorithm for two-block separable convex optimization problems with linear constraints, Journal of Optimization Theory and Applications 182(1), 110–132 (2019).

Soziale Medien

Verbinde dich mit uns: