Characterization and recognition of d.c. functions

A function $${f : \Omega \to \mathbb{R}}$$ , where Ω is a convex subset of the linear space X, is said to be d.c. (difference of convex) if f =  g − h with $${g, h : \Omega \to \mathbb{R}}$$ convex functions. While d.c. functions find various applications, especially in optimization, the problem to characterize them is not trivial. There exist a few known characterizations involving cyclically monotone set-valued functions. However, since it is not an easy task to check that a given set-valued function is cyclically monotone, simpler characterizations are desired. The guideline characterization in this paper is relatively simple (Theorem 2.1), but useful in various applications. For example, we use it to prove that piecewise affine functions in an arbitrary linear space are d.c. Additionally, we give new proofs to the known results that C1,1 functions and lower-C2 functions are d.c. The main goal remains to generalize to higher dimensions a known characterization of d.c. functions in one dimension: A function $${f : \Omega \to \mathbb{R}, \Omega \subset \mathbb{R}}$$ open interval, is d.c. if and only if on each compact interval in Ω the function f is absolutely continuous and has a derivative of bounded variation. We obtain a new necessary condition in this direction (Theorem 3.8). We prove an analogous sufficient condition under stronger hypotheses (Theorem 3.11). The proof is based again on the guideline characterization. Finally, we obtain results concerning the characterization of convex and d.c. functions obeying some kind of symmetry.

[1]  Michel Volle,et al.  Duality Principles for Optimization Problems Dealing with the Difference of Vector-Valued Convex Mappings , 2002 .

[2]  Jean-Paul Penot,et al.  Approximation and decomposition properties of some classes of locally D.C. functions , 1988, Math. Program..

[3]  Set-valued mapping monotonicity as characterization of D.C functions , 2009 .

[4]  V. F. Demyanov,et al.  An Introduction to Quasidifferential Calculus , 2000 .

[5]  Emilio Carrizosa,et al.  Optimization of the Norm of a Vector-Valued DC Function and Applications , 2000 .

[6]  A. Elhilali Alaoui Caractérisation des fonctions D.C. , 1996 .

[7]  J. Martínez-Legaz,et al.  Characterization of d.c. functions in terms of quasidifferentials , 2011 .

[8]  Gordon Whyburn,et al.  Functions and Mappings , 1979 .

[9]  R. Ellaia,et al.  Characterization of nonsmooth functions through their generalized gradients , 1991 .

[10]  P. Hartman On functions representable as a difference of convex functions , 1959 .

[11]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[12]  J. Hiriart-Urruty Generalized Differentiability / Duality and Optimization for Problems Dealing with Differences of Convex Functions , 1985 .

[13]  Juan Enrique Martínez-Legaz,et al.  Duality For D.C. Optimization Over Compact Sets , 2001 .

[14]  Wen-yuSun,et al.  PROXIMAL POINT ALGORITHM FOR MINIMIZATION OF DC FUNCTION , 2003 .

[15]  Mireille L. Bougeard,et al.  Morse theory for some lower-C2 functions in finite dimension , 1988, Math. Program..

[16]  Jakub Duda,et al.  ON D.C. FUNCTIONS AND MAPPINGS , 2001 .

[17]  C. Zălinescu Convex analysis in general vector spaces , 2002 .

[18]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[19]  S. Dempe,et al.  Necessary optimality conditions of a D.C. set-valued bilevel optimization problem , 2008 .

[20]  Moudafi,et al.  ON THE CONVERGENCE OF AN APPROXIMATE PROXIMAL METHOD FOR DC FUNCTIONS , 2006 .

[21]  Y. Yomdin On functions representable as a supremum of a family of smooth functions II , 1986 .

[22]  M. Laghdir OPTIMALITY CONDITIONS IN DC-CONSTRAINED OPTIMIZATION , 2005 .