Global convergence of a proximal linearized algorithm for difference of convex functions
Abstract
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.
Fichier principal
Global convergence of a proximal linearized algorithm for difference of convex functions.pdf (737.7 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)