University of Birmingham > Talks@bham > Optimisation and Numerical Analysis Seminars > Fenchel Duality Theory and a Primal-Dual Algorithm on Riemannian Manifolds

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

Add to your list(s) Download to your calendar using vCal

  • UserRonny Bergmann (TU Chemnitz, Germany)
  • ClockWednesday 26 February 2020, 12:00-13:00
  • HousePhysics West 103.

If you have a question about this talk, please contact Sergey Sergeev.

In this talk we introduces a new duality theory that 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 even converges on manifolds of positive curvature.

This talk is part of the Optimisation and Numerical Analysis Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.