A subdifferential characterization via Busemann functions and applications to DC optimization on Hadamard manifolds
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912923265269760 |
|---|---|
| author | Ferreira, O. P. Gonçalves, D. S. Louzeiro, M. S. Németh, S. Z. Zhu, J. |
| author_facet | Ferreira, O. P. Gonçalves, D. S. Louzeiro, M. S. Németh, S. Z. Zhu, J. |
| contents | This paper investigates the properties of Busemann functions on Hadamard manifolds and their use in optimization algorithms in Riemannian settings. We present a new Busemann-based characterization of the subdifferential, which is particularly well suited to Riemannian optimization. In the classical Hadamard manifold framework, a subgradient provides a global lower model of a convex function expressed through the inverse exponential map. However, this model may fail to exhibit a useful convexity or concavity structure. By contrast, our characterization yields a concave bounding function by exploiting key properties of Busemann functions. We use this concavity to design and analyze difference-of-convex (DC) optimization methods on Hadamard manifolds. In particular, we reformulate the classical DC algorithm (DCA) for Riemannian contexts and study its convergence properties. We also report preliminary numerical experiments comparing the proposed Busemann DCA, which leads to geodesically convex subproblems, with the classical Riemannian DCA. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_20931 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A subdifferential characterization via Busemann functions and applications to DC optimization on Hadamard manifolds Ferreira, O. P. Gonçalves, D. S. Louzeiro, M. S. Németh, S. Z. Zhu, J. Optimization and Control This paper investigates the properties of Busemann functions on Hadamard manifolds and their use in optimization algorithms in Riemannian settings. We present a new Busemann-based characterization of the subdifferential, which is particularly well suited to Riemannian optimization. In the classical Hadamard manifold framework, a subgradient provides a global lower model of a convex function expressed through the inverse exponential map. However, this model may fail to exhibit a useful convexity or concavity structure. By contrast, our characterization yields a concave bounding function by exploiting key properties of Busemann functions. We use this concavity to design and analyze difference-of-convex (DC) optimization methods on Hadamard manifolds. In particular, we reformulate the classical DC algorithm (DCA) for Riemannian contexts and study its convergence properties. We also report preliminary numerical experiments comparing the proposed Busemann DCA, which leads to geodesically convex subproblems, with the classical Riemannian DCA. |
| title | A subdifferential characterization via Busemann functions and applications to DC optimization on Hadamard manifolds |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2602.20931 |