Skip to main navigation Skip to search Skip to main content

Extremal Points and Sparse Optimization for Generalized Kantorovich–Rubinstein Norms

Research output: Contribution to journal › Article › Academic › peer-review

214 Downloads (Pure)

Abstract

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 fully corrective 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 behavior is also reflected in numerical examples for a model problem.

Original languageEnglish
Pages (from-to)103-144
Number of pages42
JournalFoundations of Computational Mathematics
Volume25
Issue number1
Early online date11 Dec 2023
DOIs
Publication statusPublished - Feb 2025

Keywords

  • 2024 OA procedure
  • Extremal points
  • Inverse problems
  • Kantorovich–Rubinstein duality
  • Optimal design
  • Sparse optimization
  • Unbalanced optimal transport
  • Conditional gradient methods

Fingerprint

Dive into the research topics of 'Extremal Points and Sparse Optimization for Generalized Kantorovich–Rubinstein Norms'. Together they form a unique fingerprint.

Cite this