Gebken, Bennet. “A Note on the Convergence of Deterministic Gradient Sampling in Nonsmooth Optimization.”10.1007/s10589-024-00552-0__Computational Optimization and Applications, Springer Science and Business Media LLC, 2024, doi:10.1007/s10589-024-00552-0.
LibreCat: /record/51208
DOI: 10.1007/s10589-024-00552-0

Sonntag, Konstantin, et al. “A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces.” ArXiv:2402.06376, 2024.
LibreCat: /record/51334
arXiv: 	2402.06376

Gebken, Bennet, et al. “On the Structure of Regularization Paths for Piecewise Differentiable Regularization Terms.”10.1007/s10898-022-01223-2__Journal of Global Optimization, vol. 85, no. 3, 2023, pp. 709–41, doi:10.1007/s10898-022-01223-2.
LibreCat: /record/27426
DOI: 10.1007/s10898-022-01223-2

Bernreuther, Marco, et al. “Multiobjective Optimization of Non-Smooth PDE-Constrained Problems.” ArXiv:2308.01113, 2023.
LibreCat: /record/46578
arXiv: 2308.01113

Banholzer, Stefan, et al. “ROM-Based Multiobjective Optimization of Elliptic PDEs via Numerical Continuation.”10.1007/978-3-030-79393-7_3__Non-Smooth and Complementarity-Based Distributed Parameter Systems, edited by Hintermüller Michael et al., Springer, 2022, pp. 43–76, doi:10.1007/978-3-030-79393-7_3.
LibreCat: /record/16296
DOI: 10.1007/978-3-030-79393-7_3

Gebken, Bennet. “Using Second-Order Information in Gradient Sampling Methods for  Nonsmooth Optimization.” ArXiv:2210.04579, 2022.
LibreCat: /record/34618
arXiv: 2210.04579

Gebken, Bennet. Computation and Analysis of Pareto Critical Sets in Smooth and Nonsmooth Multiobjective Optimization. 2022, doi:10.17619/UNIPB/1-1327.
LibreCat: /record/31556
DOI: 10.17619/UNIPB/1-1327

Bieker, Katharina, et al. “On the Treatment of Optimization Problems with L1 Penalty Terms via Multiobjective Continuation.”10.1109/TPAMI.2021.3114962__IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 44, no. 11, IEEE, 2022, pp. 7797–808, doi:10.1109/TPAMI.2021.3114962.
LibreCat: /record/20731
DOI: 10.1109/TPAMI.2021.3114962

Gebken, Bennet, and Sebastian Peitz. “An Efficient Descent Method for Locally Lipschitz Multiobjective Optimization Problems.”10.1007/s10957-020-01803-w__Journal of Optimization Theory and Applications, vol. 188, 2021, pp. 696–723, doi:10.1007/s10957-020-01803-w.
LibreCat: /record/16867
DOI: 10.1007/s10957-020-01803-w

Gebken, Bennet, and Sebastian Peitz. “Inverse Multiobjective Optimization: Inferring Decision Criteria from Data.”10.1007/s10898-020-00983-z__Journal of Global Optimization, vol. 80, Springer, 2021, pp. 3–29, doi:10.1007/s10898-020-00983-z.
LibreCat: /record/16295
DOI: 10.1007/s10898-020-00983-z

Dellnitz, Michael, et al. “On the Equivariance Properties of Self-Adjoint Matrices.”10.1080/14689367.2019.1661355__Dynamical Systems, vol. 35, no. 2, 2020, pp. 197–215, doi:10.1080/14689367.2019.1661355.
LibreCat: /record/16712
DOI: 10.1080/14689367.2019.1661355

Gebken, Bennet, et al. “On the Hierarchical Structure of Pareto Critical Sets.”10.1007/s10898-019-00737-6__Journal of Global Optimization, vol. 73, no. 4, 2019, pp. 891–913, doi:10.1007/s10898-019-00737-6.
LibreCat: /record/10595
DOI: 10.1007/s10898-019-00737-6

Gebken, Bennet, et al. “A Descent Method for Equality and Inequality Constrained Multiobjective Optimization Problems.”10.1007/978-3-319-96104-0_2__Numerical and Evolutionary Optimization – NEO 2017, 2018, doi:10.1007/978-3-319-96104-0_2.
LibreCat: /record/8750
DOI: 10.1007/978-3-319-96104-0_2