A bundle method for minimizing the difference of convex (DC) and possibly nonsmooth functions is developed. The method may be viewed as an inexact version of the DC algorithm, where each subproblem is solved only approximately by a bundle method. We always terminate the bundle method after the...

A bundle method for minimizing the difference of convex (DC) and possibly nonsmooth functions is developed. The method may be viewed as an inexact version of the DC algorithm, where each subproblem is solved only approximately by a bundle method. We always terminate the bundle method after the...

Measurements for fitting a given number of concentric circles are recorded. For each concentric circle several measurements are taken. The problem is to fit the given number of circles to the data such that all circles have a common center. This is a generalization of the problem of fitting a...

Measurements for fitting a given number of concentric circles are recorded. For each concentric circle several measurements are taken. The problem is to fit the given number of circles to the data such that all circles have a common center. This is a generalization of the problem of fitting a...

This paper aims to study a broad class of generalized semi-infinite programming problems with (upper and lower level) objectives given as the difference of two convex functions, and (lower level) constraints described by a finite number of convex inequalities and a set constraints. First, we are...