Extremal points and sparse optimization for generalized Kantorovich-Rubinstein norms
Not on the map. Why?
Abstract (arXiv)
A precise characterization of the extremal points of sublevel sets of nonsmooth penalties provides both detailed information about minimizers, and optimality conditions in general classes of minimization problems involving them. Moreover, it enables the application of accelerated generalized conditional gradient methods for their efficient solution. In this manuscript, this program is adapted to the minimization of a smooth convex fidelity term which is augmented with an unbalanced transport regularization term given in the form of a generalized Kantorovich-Rubinstein norm for Radon measures. More precisely, we show that the extremal points associated to the latter are given by all Dirac delta functionals supported in the spatial domain as well as certain dipoles, i.e., pairs of Diracs with the same mass but with different signs. Subsequently, this characterization is used to derive precise first-order optimality conditions as well as an efficient solution algorithm for which linear convergence is proved under natural assumptions. This behaviour is also reflected in numerical examples for a model problem.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 19 Sep 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1.
1 paper.