Bennet Gebken

According to our database, Bennet Gebken authored at least 9 papers between 2019 and 2026.

Collaborative distances:

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

2026

Technical Results on the Convergence of Quasi-Newton Methods for Nonsmooth Optimization.

Bennet Gebken

J. Optim. Theory Appl., May, 2026

2025

Analyzing the Speed of Convergence in Nonsmooth Optimization via the Goldstein subdifferential.

Bennet Gebken

J. Optim. Theory Appl., September, 2025

2024

A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces.

Konstantin Sonntag, Bennet Gebken, Georg Müller, Sebastian Peitz, Stefan Volkwein

J. Optim. Theory Appl., October, 2024

A note on the convergence of deterministic gradient sampling in nonsmooth optimization.

Bennet Gebken

Comput. Optim. Appl., May, 2024

2023

On the structure of regularization paths for piecewise differentiable regularization terms.

Bennet Gebken, Katharina Bieker, Sebastian Peitz

J. Glob. Optim., March, 2023

2022

On the Treatment of Optimization Problems With L1 Penalty Terms via Multiobjective Continuation.

Katharina Bieker, Bennet Gebken, Sebastian Peitz

IEEE Trans. Pattern Anal. Mach. Intell., 2022

2021

An Efficient Descent Method for Locally Lipschitz Multiobjective Optimization Problems.

Bennet Gebken, Sebastian Peitz

J. Optim. Theory Appl., 2021

Inverse multiobjective optimization: Inferring decision criteria from data.

Bennet Gebken, Sebastian Peitz

J. Glob. Optim., 2021

2019

On the hierarchical structure of Pareto critical sets.

Bennet Gebken, Sebastian Peitz, Michael Dellnitz

J. Glob. Optim., 2019