Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata

https://hal-amu.archives-ouvertes.fr/hal-01440298
Contributor : Patrice Cacciuttolo Connect in order to contact the contributor
Submitted on : Thursday, January 19, 2017 - 11:15:02 AM
Last modification on : Thursday, November 4, 2021 - 11:58:07 AM

Identifiers

Collections

Citation

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

Share

Metrics

Record views

241