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

Abstract

ADInternational audienceA 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

Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming

“…The development of local search methods in DC programming has attracted less attention. There exist several methods specifically designed for nonsmooth DC programming problems using their explicit DC representations [2,5,17,35]. In addition, a gradient splitting method introduced in [12] can be modified for minimizing DC functions.…”

Split proximal linearized algorithm and convergence theorems for the split DC program

“…Further, Souza, Oliveira, and Soubeyran [15] gave the following convergence theorem for problem (DCP). In this paper, we want to study the split DC program:…”

A forward-backward algorithm for the DC programming in Hilbert spaces

“…So, many researchers focus their attentions on finding points such that ∂ h(x) ∩ ∂ g(x) = / 0, where x is called a critical point of f [14]. For more details about DC functions and DC programming, one refers to [7,8,9,10,11,12,13,14,17,18,19].…”

“…In 2016, Souza, Oliveira, and Soubeyran [18] proposed a proximal linearized algorithm to study DC programming. following         …”