The difference of convex algorithm on Hadamard manifolds

DOI10.1007/S10957-024-02392-8MaRDI QIDQ6385265zbMATH OpenFDO

Authors Ronny Bergmann, O. P. Ferreira, Elianderson M. Santos, João Carlos O. Souza

Publication date 9 December 2021

Full work available at URL https://doi.org/10.1007/S10957-024-02392-8

Mathematics Subject Classification ID

Manifolds and measure-geometric topics (49Q99) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

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. We establish the equivalence between the classical and simplified Riemannian versions of the DCA. 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. Additionally, we establish some duality relations between the DC problem and its dual. To illustrate the effectiveness of the algorithm, we present some numerical experiments.

Recommendations

• A proximal point algorithm for DC functions on Hadamard manifolds
• A modified proximal point method for DC functions on Hadamard manifolds
• Minimizing compositions of differences-of-convex functions with smooth mappings
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming and DCA: thirty years of developments

Cited in

(3)

• The proximal point method for sum of DC functions in Hadamard manifolds
• Lagrange duality on DC evenly convex optimization problems via a generalized conjugation scheme
• Efficient Douglas-Rachford methods on Hadamard manifolds with applications to the Heron problems

This page was built for publication: The difference of convex algorithm on Hadamard manifolds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6385265)