Auxiliary problem principle and inexact variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
Résumé
In view of the minimization of a function
which is the sum of a differentiable function $f$ and a convex function $g$ we
introduce descent methods which can be viewed as produced by inexact auxiliary problem principle
or inexact variable metric forward-backward algorithm.
Assuming that the global objective function satisfies the Kurdyka-Lojasiewicz inequality
we prove the convergence of the proposed algorithm
weakening assumptions found in previous works.
Fichier principal
ppa-preprint.pdf (190.36 Ko)
Télécharger le fichier
ppa.bib (9.27 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Origine : Fichiers produits par l'(les) auteur(s)