Fenchel Duality Theory and a Primal-Dual Algorithm on Riemannian Manifolds

Bergmann R, Herzog R, Silva Louzeiro M, Tenbrinck D, Vidal-Núñez J (2021)

Publication Type: Journal article

Publication year: 2021

Journal

Foundations of Computational Mathematics Springer Verlag (Germany)

DOI: 10.1007/s10208-020-09486-5

Abstract

This paper introduces a new notion of a Fenchel conjugate, which generalizes the classical Fenchel conjugation to functions defined on Riemannian manifolds. We investigate its properties, e.g., the Fenchel–Young inequality and the characterization of the convex subdifferential using the analogue of the Fenchel–Moreau Theorem. These properties of the Fenchel conjugate are employed to derive a Riemannian primal-dual optimization algorithm and to prove its convergence for the case of Hadamard manifolds under appropriate assumptions. Numerical results illustrate the performance of the algorithm, which competes with the recently derived Douglas–Rachford algorithm on manifolds of nonpositive curvature. Furthermore, we show numerically that our novel algorithm may even converge on manifolds of positive curvature.

Authors with CRIS profile

Daniel Tenbrinck Lehrstuhl für Angewandte Mathematik (Modellierung und Numerik)

Involved external institutions

Technische Universität Chemnitz DE Germany (DE) Universidad de Alcalá (UAH) ES Spain (ES)

How to cite

APA:

Bergmann, R., Herzog, R., Silva Louzeiro, M., Tenbrinck, D., & Vidal-Núñez, J. (2021). Fenchel Duality Theory and a Primal-Dual Algorithm on Riemannian Manifolds. Foundations of Computational Mathematics. https://doi.org/10.1007/s10208-020-09486-5

MLA:

Bergmann, Ronny, et al. "Fenchel Duality Theory and a Primal-Dual Algorithm on Riemannian Manifolds." Foundations of Computational Mathematics (2021).

BibTeX: Download