The Boosted DC Algorithm for nonsmooth functions

The Boosted Difference of Convex functions Algorithm (BDCA) was recently proposed for minimizing smooth difference of convex (DC) functions. BDCA accelerates the convergence of the classical Difference of Convex functions Algorithm (DCA) thanks to an additional line search step. The purpose of this paper is twofold. Firstly, to show that this scheme can be generalized and successfully applied to certain types of nonsmooth DC functions, namely, those that can be expressed as the difference of a smooth function and a possibly nonsmooth one. Secondly, to show that there is complete freedom in the choice of the trial step size for the line search, which is something that can further improve its performance. We prove that any limit point of the BDCA iterative sequence is a critical point of the problem under consideration, and that the corresponding objective value is monotonically decreasing and convergent. The global convergence and convergent rate of the iterations are obtained under the Kurdyka-Lojasiewicz property. Applications and numerical experiments for two problems in data science are presented, demonstrating that BDCA outperforms DCA. Specifically, for the Minimum Sum-of-Squares Clustering problem, BDCA was on average sixteen times faster than DCA, and for the Multidimensional Scaling problem, BDCA was three times faster than DCA.

READ FULL TEXT
research
07/26/2019

Using positive spanning sets to achieve stationarity with the Boosted DC Algorithm

The Difference of Convex function Algorithm (DCA) is widely used for min...
research
08/31/2023

Frank-Wolfe algorithm for DC optimization problem

In the present paper, we formulate two versions of Frank–Wolfe algorithm...
research
04/19/2018

A refined convergence analysis of pDCA_e with applications to simultaneous sparse recovery and outlier detection

We consider the problem of minimizing a difference-of-convex (DC) functi...
research
05/18/2023

Difference of Submodular Minimization via DC Programming

Minimizing the difference of two submodular (DS) functions is a problem ...
research
04/30/2021

A Refined Inertial DCA for DC Programming

We consider the difference-of-convex (DC) programming problems whose obj...
research
11/02/2021

Faster Convex Lipschitz Regression via 2-block ADMM

The task of approximating an arbitrary convex function arises in several...
research
11/20/2022

On the convergence analysis of DCA

In this paper, we propose a clean and general proof framework to establi...

Please sign up or login with your details

Forgot password? Click here to reset