2 citations · 3 across the 10 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.OC2020
On the Treatment of Optimization Problems with L1 Penalty Terms via Multiobjective Continuation
Katharina Bieker, Bennet Gebken, Sebastian Peitz
We present a novel algorithm that allows us to gain detailed insight into the effects of sparsity in linear and nonlinear optimization, which is of great importance in many scienti…
math.OC2020
An efficient descent method for locally Lipschitz multiobjective optimization problems
Bennet Gebken, Sebastian Peitz
In this article, we present an efficient descent method for locally Lipschitz continuous multiobjective optimization problems (MOPs). The method is realized by combining a theoreti…