Global convergence of a proximal linearized algorithm for difference of convex functions - Aix-Marseille Université Accéder directement au contenu
Article Dans Une Revue Optimization Letters Année : 2016

Global convergence of a proximal linearized algorithm for difference of convex functions

Résumé

A proximal linearized algorithm for minimizing difference of two convex functions is proposed. If the sequence generated by the algorithm is bounded it is proved that every cluster point is a critical point of the function under consideration, even if the auxiliary minimizations are performed inexactly at each iteration. Linear convergence of the sequence is established under suitable additional assumptions.

Mots clés

Fichier principal
Vignette du fichier
Global convergence of a proximal linearized algorithm for difference of convex functions.pdf (737.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01440298 , version 1 (13-02-2023)

Identifiants

Citer

João Carlos O. Souza, Paulo Roberto Oliveira, Antoine Soubeyran. Global convergence of a proximal linearized algorithm for difference of convex functions. Optimization Letters, 2016, 10 (7), pp.1529--1539. ⟨10.1007/s11590-015-0969-1⟩. ⟨hal-01440298⟩
82 Consultations
68 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More