The Nelder-Mead simplex method for function minimization is a "direct" method requiring no derivatives. The objective function is evaluated at the vertices of a simplex, and movement is away from the ...

In this paper we present some algorithms for minimization of DC function (difference of two convex functions). They are descent methods of the proximal-type which use the convex properties of the two ...