Anna Lentz

collaborators

3 papers

math.OC2025

A smoothed proximal trust-region algorithm for nonconvex optimization problems with $L^{p}$ -regularization, $p \in (0, 1)$

Harbir Antil, Anna Lentz

We investigate a trust-region algorithm to solve a nonconvex optimization problem with $L^{p}$ -regularization for $p \in (0, 1)$ . The algorithm relies on descent properties of a so-call…

math.OC2025

Spatially sparse optimization problems in fractional order Sobolev spaces

Anna Lentz, Daniel Wachsmuth

We investigate time-dependent optimization problems in fractional Sobolev spaces with the sparsity promoting $L^{p}$ -pseudo norm for $0 < p < 1$ in the objective functional. In order to…

math.AP2024

Capacitary measures in fractional order Sobolev spaces: Compactness and applications to minimization problems

Anna Lentz

Capacitary measures form a class of measures that vanish on sets of capacity zero. These measures are compact with respect to so-called $I^^{3}$ -convergence, which relates a sequence o…

A smoothed proximal trust-region algorithm for nonconvex optimization problems with Lp-regularization, p∈(0,1)

Spatially sparse optimization problems in fractional order Sobolev spaces

Capacitary measures in fractional order Sobolev spaces: Compactness and applications to minimization problems

A smoothed proximal trust-region algorithm for nonconvex optimization problems with $L^{p}$ -regularization, $p \in (0, 1)$