D4 Published development or research report or study
Double Bundle Method for Nonsmooth DC Optimization




List of Authors: Kaisa Joki, Adil M. Bagirov, Napsu Karmitsa, Marko M. Mäkelä, Sona Taheri
Publisher: Turku Centre for Computer Science
Place: Turku
Publication year: 2017
Journal: TUCS Publication Series
Title of series: TUCS Technical Report
Number in series: 1173
ISBN: 978-952-12-3500-9
ISSN: 1239-1891

Abstract

The aim of this paper is to introduce a new proximal double bundle method for unconstrained nonsmooth DC optimization, where the objective function is presented as a difference of two convex (DC) functions. The novelty in our method is a new stopping procedure guaranteeing Clarke stationarity for solutions by utilizing only 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 Clarke stationary, then the stopping procedure yields a descent direction. With this new stopping procedure we can avoid some drawbacks, which are encountered when criticality is used. The finite convergence of the method is proved to a Clarke stationary point under mild assumptions. Finally, some encouraging numerical results are presented.


Downloadable publication

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.




Last updated on 2019-20-07 at 16:20