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



: Joki K, Bagirov AM, Karmitsa N, Makela MM, Taheri S

Publisher: SIAM PUBLICATIONS

: 2018

: SIAM Journal on Optimization

: SIAM JOURNAL ON OPTIMIZATION

: SIAM J OPTIMIZ

: 28

: 2

: 1892

: 1919

: 28

: 1052-6234

: 1095-7189

DOI: https://doi.org/10.1137/16M1115733(external)

: https://research.utu.fi/converis/portal/detail/Publication/32192314(external)


The aim of this paper is to introduce a new proximal double bundle method for unconstrained nonsmooth optimization, where the objective function is presented as a difference of two convex (DC) functions. The novelty in our method is a new escape procedure which enables us to guarantee approximate Clarke stationarity for solutions by utilizing the DC components of the objective function. This optimality condition is stronger than the criticality condition typically used in DC programming. Moreover, if a candidate solution is not approximate Clarke stationary, then the escape procedure returns a descent direction. With this escape procedure, we can avoid some shortcomings encountered when criticality is used. The finite termination of the double bundle method to an approximate Clarke stationary point is proved by assuming that the subdifferentials of DC components are polytopes. Finally, some encouraging numerical results are presented.

Last updated on 2024-26-11 at 12:15