| dc.contributor.author | Bergmann, Ronny | |
| dc.contributor.author | Ferreira, Orizon P. | |
| dc.contributor.author | M. Santos, Elianderson | |
| dc.contributor.author | Souza, João Carlos O. | |
| dc.date.accessioned | 2024-04-10T13:36:47Z | |
| dc.date.available | 2024-04-10T13:36:47Z | |
| dc.date.created | 2024-02-26T16:40:47Z | |
| dc.date.issued | 2024 | |
| dc.identifier.citation | J Optim Theory Appl (2024) | en_US |
| dc.identifier.issn | 0022-3239 | |
| dc.identifier.uri | https://hdl.handle.net/11250/3125859 | |
| dc.description.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. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Springer | en_US |
| dc.title | The Difference of Convex Algorithm on Hadamard Manifolds | en_US |
| dc.title.alternative | The Difference of Convex Algorithm on Hadamard Manifolds | en_US |
| dc.type | Preprint | en_US |
| dc.description.version | submittedVersion | en_US |
| dc.source.journal | Journal of Optimization Theory and Applications | en_US |
| dc.identifier.doi | 10.1007/s10957-024-02392-8 | |
| dc.identifier.cristin | 2249967 | |
| cristin.ispublished | true | |
| cristin.fulltext | preprint | |
| cristin.qualitycode | 1 | |
