Answers are grounded in this paper and cite their sources.
In this paper, we propose a new method for the unconstrained minimization of a function presented as a difference of two convex functions. This method is based on continuous approximations to the Demyanov-Rubinov quasidifferential. First, a terminating algorithm for the computation of a descent direction of the objective function is described. Then we present a minimization algorithm and study its convergence. An implementable version of this algorithm is discussed. Finally, we report the results of preliminary numerical experiments.
No takes yet. Share an insight, caveat, or question.
Adil Bagirov (2002) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: