REVIEW 1 cited by
Fenchel Duality Theory and A Primal-Dual Algorithm on Riemannian Manifolds
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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 even converges on manifolds of positive curvature.
Forward citations
Cited by 1 Pith paper
-
The Intrinsic Riemannian Proximal Gradient Method for Convex Optimization
An intrinsic Riemannian proximal gradient method is shown to converge sublinearly on geodesically convex problems and linearly on strongly convex problems over Hadamard manifolds.
Discussion (0). Continue with ORCID to comment.