| Alternating proximal-gradient steps for (stochastic) nonconvex-concave minimax problems RI Boţ, A Böhm SIAM Journal on Optimization 33 (3), 1884-1913, 2023 | 50 | 2023 |
| Solving Nonconvex-Nonconcave Min-Max Problems exhibiting Weak Minty Solutions A Böhm Transactions on Machine Learning Research, 2023 | 32 | 2023 |
| Two Steps at a Time---Taking GAN Training in Stride with Tseng's Method A Böhm, M Sedlmayer, ER Csetnek, RI Bot SIAM Journal on Mathematics of Data Science 4 (2), 750-771, 2022 | 32 | 2022 |
| Variable smoothing for weakly convex composite functions A Böhm, SJ Wright Journal of Optimization Theory and Applications 188 (3), 628-649, 2021 | 30 | 2021 |
| Variable smoothing for convex optimization problems using stochastic gradients RI Boţ, A Böhm Journal of Scientific Computing 85 (2), 2020 | 19 | 2020 |
| Beyond the golden ratio for variational inequality algorithms A Alacaoglu, A Böhm, Y Malitsky Journal of Machine Learning Research 24 (172), 1-33, 2023 | 10 | 2023 |
| An incremental mirror descent subgradient algorithm with random sweeping and proximal step RI Boţ, A Böhm Optimization 68 (1), 33-50, 2019 | 5 | 2019 |
| Ubiquitous algorithms in convex optimization generate self-contracted sequences A Böhm, A Daniilidis Journal of Convex Analysis 29 (1), 119-128, 2022 | 2 | 2022 |
