Back to Search
Start Over
The Difference of Convex Algorithm on Hadamard Manifolds.
- Source :
- Journal of Optimization Theory & Applications; Apr2024, Vol. 201 Issue 1, p221-251, 31p
- Publication Year :
- 2024
-
Abstract
- In this paper, we propose a Riemannian version of the difference of convex algorithm (DCA) to solve a minimization problem involving the difference of convex (DC) function. The equivalence between the classical and simplified Riemannian versions of the DCA is established. We also prove that under mild assumptions the Riemannian version of the DCA is well defined and every cluster point of the sequence generated by the proposed method, if any, is a critical point of the objective DC function. Some duality relations between the DC problem and its dual are also established. To illustrate the algorithm's effectiveness, some numerical experiments are presented. [ABSTRACT FROM AUTHOR]
- Subjects :
- ALGORITHMS
PROBLEM solving
Subjects
Details
- Language :
- English
- ISSN :
- 00223239
- Volume :
- 201
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Journal of Optimization Theory & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 176651097
- Full Text :
- https://doi.org/10.1007/s10957-024-02392-8