Abstract.
Optimization problems involving differences of functions arouse interest as generalizations of so-called d.c. problems, i.e. problems involving the difference of two convex functions. The class of d.c. functions is very rich, so d.c. problems are rather general optimization problems. Several global optimality conditions for these d.c. problems have been proposed in the optimization literature. We provide a survey of these conditions and try to detect their common basis. This enables us to give generalizations of the conditions to situations when the objective function is no longer a difference of convex functions, but the difference of two functions which are representable as the upper envelope of an arbitrary family of functions.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
(Received 6 February 2001; in revised form 11 October 2001)
Rights and permissions
About this article
Cite this article
Dür, M. Conditions Characterizing Minima of the Difference of Functions. Mh Math 134, 295–303 (2002). https://doi.org/10.1007/s605-002-8264-4
Issue Date:
DOI: https://doi.org/10.1007/s605-002-8264-4