Skip to main content
SpringerLink
Log in

The directional subdifferential of the difference of two convex functions

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We provide a criterion giving a formula for the directional (or contingent) subdifferential of the difference of two convex functions. We even extend it to the difference of two approximately starshaped functions. Our analysis relies on a notion of approximate monotonicity for operators which is much less demanding than the usual one.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Amahroq T., Penot J.-P., Syam A.: On the subdifferentiability of the difference of two functions and local minimization. Set-Value. Anal. 16(4), 413–427 (2008)

    Article  Google Scholar 

  2. An L.T.H., Pham D.T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23–46 (2005)

    Article  Google Scholar 

  3. An L.T.H., Pham D.T.: Convex analysis approach to d. c. programming: theory, algorithms and applications. Acta Math. Vietnam 22(1), 289–355 (1997)

    Google Scholar 

  4. Asplund E.: Differentiability of the metric projection in finite dimensional Euclidean space. Proc. Am. Math. Soc. 38, 218–219 (1973)

    Google Scholar 

  5. Aubin J.-P.: Mutational and morphological analysis. Tools for shape evolution and morphogenesis, systems and control: foundations and applications. Birkhäuser, Boston (1999)

    Google Scholar 

  6. Aussel D., Daniilidis A., Thibault L.: Subsmooth sets: functional characterizations and related concepts. Trans. Am. Math. Soc. 357(4), 1275–1301 (2005)

    Article  Google Scholar 

  7. Caprari E., Penot J.-P.: Tangentially d.-s. functions. Optimization 56(1), 25–38 (2007)

    Article  Google Scholar 

  8. Dinh, N., Nghia, T.T.A., Vallet, G.: A closedness condition and its applications to DC programs with convex constraints (preprint) (2006)

  9. Dinh N., Vallet G., Nghia T.T.A.: Farkas-type results and duality for DC programs with convex constraints. J. Convex Anal. 15(2), 235–262 (2008)

    Google Scholar 

  10. Flores-Bazán F., Oettli W.: Simplified optimality conditions for minimizing the difference of vector-valued functions. J. Optim. Theory Appl. 108(3), 571–586 (2001)

    Article  Google Scholar 

  11. Gautier S.: Affine and eclipsing multifunctions. Numer. Funct. Anal. Optim. 11(7/8), 679–699 (1990)

    Article  Google Scholar 

  12. Hartman P.: On functions representable as a difference of convex functions. Pacific J. Math. 9, 707–713 (1959)

    Article  Google Scholar 

  13. Hiriart-Urruty, J.-B.: Generalized differentiability, duality and optimization for problems dealing with differences of convex functions. In: Ponstein, J. (ed.) Convexity and Duality in Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 256, pp. 37–70 (1986)

  14. Hiriart-Urruty, J.-B.: From convex optimization to nonconvex optimization. Necessary and sufficient conditions for global optimality, In: Clarke, F.H., Demyanov, V.F., Giannessi, F. (eds.) Nonsmooth optimization and related topics, pp. 219–239, Ettore Majorana Internat. Sci. Ser. Phys. Sci., vol. 43. Plenum, New York (1989)

  15. Hiriart-Urruty J.-B.: A general formula on the conjugate of the difference of functions. Can. Math. Bull. 29, 482–485 (1986)

    Article  Google Scholar 

  16. Hiriart-Urruty J.-B.: How to regularize a difference of convex functions. J. Math. Anal. Appl. 162, 196–209 (1991)

    Article  Google Scholar 

  17. Hiriart-Urruty J.-B., Ledyaev Y.S.: A note on the characterization of the global maxima of a (tangentially) convex function over a convex set. J. Convex Anal. 3(1), 55–61 (1996)

    Google Scholar 

  18. Horst R., Thoai N.V.: DC programming: overview. J. Optim. Theory Appl. 103, 1–43 (1999)

    Article  Google Scholar 

  19. Horst R., Tuy H.: Global Optimization (Deterministic Approaches). Springer, Berlin (1993)

    Google Scholar 

  20. Horst R., Pardalos P.M.: Handbook of Global Optimization, Nonconvex Optimization and Its Applications, vol. 2. Kluwer, Dordrecht (1995)

    Google Scholar 

  21. Horst R., Pardalos P.M., Thoai N.V.: Introduction to Global Optimization, Nonconvex Optimization and Its Applications, vol. 48. Kluwer, Dordrecht (2000)

    Google Scholar 

  22. Laghdir M., Benkenza N., Nadjeh N.: Duality in dc-constrained programming via duality in reverse convex programming. J. Nonlinear Convex Anal. 5(2), 275–283 (2004)

    Google Scholar 

  23. Lemaire B., Volle M.: Duality in dc programming. In: Crouzeix, J.-P. (ed.) Generalized Convexity, Generalized Monotonicity: Recent Results, pp. 331–345. Kluwer, Dordrecht (1998)

    Chapter  Google Scholar 

  24. Martínez-Legaz J.E., Penot J.-P.: Regularization by erasement. Math. Scand. 98, 97–124 (2006)

    Google Scholar 

  25. Martínez-Legaz J.E., Seeger A.: A formula on the approximate subdifferential of the difference of convex functions. Bull. Aust. Math. Soc. 45, 37–41 (1992)

    Article  Google Scholar 

  26. Martínez-Legaz, J.E., Volle, M.: Duality for d.c. optimization over compact sets, In: Giannessi, F. et al. (eds.) Optimization Theory. Recent Developments from Mátraháza. Appl. Optim. vol. 59, pp. 139–146. Kluwer, Dordrecht (2001)

  27. Martínez-Legaz, J.E., Volle, M.: Duality in D. C. programming: The case of several D. C. constraints. J. Math. Anal. Appl. 237(2) (1999), 29(4), 482–485 (1986)

    Google Scholar 

  28. Matheron G.: Random Sets and Integral Geometry, Wiley Series in Probability and Mathematical Statistics. Wiley, New York (1975)

    Google Scholar 

  29. Michelot, C.: Caractérisation des minima locaux des fonctions de la classe d.c. preprint. University of Bourgogne, Dijon (1987)

  30. Ngai H.V., Luc D.T., Théra M.: Approximate convex functions. J. Nonlinear Convex Anal. 1(2), 155–176 (2000)

    Google Scholar 

  31. Ngai H.V., Penot J.-P.: Approximately convex functions and approximately monotone operators. Nonlinear Anal. 66, 547–564 (2007)

    Article  Google Scholar 

  32. Ngai H.V., Penot J.-P.: Semismoothness and directional subconvexity of functions. Pacific J. Optim. 3(2), 323–344 (2007)

    Google Scholar 

  33. Penot, J.-P.: Variations on the theme of nonsmooth analysis : another subdifferential. In: Demyanov, V.F., Pallasche, D. (eds.) Nondifferential Optimization: Motivations and Applications. Proceedings, Sopron, Hungary, 1984, Lecture Notes in Econ. and Math. Systems, vol. 255, pp. 41–54. Springer, Berlin 1985

  34. Penot J.-P.: Duality for anticonvex programs. J. Global Optim. 19, 163–182 (2001)

    Article  Google Scholar 

  35. Penot J.-P.: Favorable classes of mappings and multimappings in nonlinear analysis and optimization. J. Convex Anal. 3(1), 97–116 (1996)

    Google Scholar 

  36. Penot J.-P.: On the minimization of difference functions. J. Global Optim. 12, 373–382 (1998)

    Article  Google Scholar 

  37. Penot J.-P.: Softness, sleekness and regularity properties in nonsmooth analysis. Nonlinear Anal. 68(9), 2750–2768 (2008)

    Article  Google Scholar 

  38. Penot J.-P.: Gap continuity of multimaps. Set-Value. Anal. 16(4), 429–442 (2008)

    Article  Google Scholar 

  39. Penot J.-P., Bougeard M.L.: Approximation and decomposition properties of some classes of locally d.c. functions. Math. Program. Ser. A 41(2), 195–227 (1988)

    Article  Google Scholar 

  40. Plazanet, Ph.: Existence et calcul des points critiques de différences de fonctions convexes. Application à l’optimisation et à l’étude d’une e.d.p., Thesis, Univ. P. Sabatier, Toulouse (1990)

  41. Pontrjagin, L.S.: Linear differential games II. Soviet Maths. 8(4) (1967)

  42. Pshenichnii, B.N.: Leçons sur les jeux différentiels, in Contrôle optimal et jeux différentiels. Cahier de l’INRIA 4, 145–226 (1971)

    Google Scholar 

  43. Rockafellar R.T.: Favorable classes of Lipschitz continuous functions in subgradient optimization. In: Nurminski, E. (eds) Nondifferentiable Optimization, Pergamon, New York (1982)

    Google Scholar 

  44. Spingarn J.E.: Submonotone subdifferentials of Lipschitz functions. Trans. Am. Math. Soc. 264, 77–89 (1981)

    Article  Google Scholar 

  45. Strekalovsky A.S.: Extremal problems on complements of convex sets. Kybernetika 1, 113–126 (1993)

    Google Scholar 

  46. Strekalovsky A.S.: Global optimality conditions for nonconvex optimization. J. Glob. Optim. 12(4), 415–434 (1998)

    Article  Google Scholar 

  47. Strekalovsky, A.S.: One way to construct a global search algorithm for d. c. minimization problems. In: Di Pillo, G. et al. (eds.) Nonlinear Optimization and Related Topics. Workshop, Erice, 1998. Appl. Optim. vol. 36, pp. 429–443. Kluwer, Dordrecht (2000)

  48. Strekalovsky, A.S.: Some remarks on d. c. programming. In: Pardalos, P.M. (eds.) Optimization and Optimal Control. International Conference on Optimization and Optimal Control, Ulaanbaatar, Mongolia, August 13–17, 2002. World Scientific Series on Computers and Operations Research, vol. 1, pp. 347–367. River Edge, NJ (2003)

  49. Taa A.: Optimality conditions for vector optimization problems of a difference of convex mappings. J. Global Optim. 31(3), 421–436 (2005)

    Article  Google Scholar 

  50. Toland J.F.: Duality in nonconvex optimization. J. Math. Anal. Appl. 66, 399–415 (1978)

    Article  Google Scholar 

  51. Toland, J.F.: On subdifferential calculus and duality in non-convex optimization. Bull. Soc. Math. Fr., Suppl., Mém. 60 (Proc. Colloq., Pau 1977), pp. 177–183 (1979)

  52. Tuy, H.: On some recent advances and applications of d. c. optimization. In: Nguyen, V.H. et al. (eds.) Optimization. Proceedings of the 9th Belgian-French-German Conference. Lect. Notes Econ. Math. Syst. vol. 481, pp. 473–497, Springer, Berlin (2000)

  53. Veselý, L.: Zajíček, Delta-convex mappings between Banach spaces and applications. Dissertationes Math. (Rozprawy Mat.) 289:52 (1980)

  54. Veselý L.: Zajíček, On composition of D.C. functions and mappings. J. Convex Anal. 16(2), 423–439 (2009)

    Google Scholar 

  55. Volle M.: Conjugaison par tranches et dualité de Toland. Optimization 18, 633–642 (1987)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculté des Sciences, Mathématiques UMR CNRS 5142, B.P. 1155, 64013, PAU Cedex, France

    Jean-Paul Penot

Authors
  1. Jean-Paul Penot
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jean-Paul Penot.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Penot, JP. The directional subdifferential of the difference of two convex functions. J Glob Optim 49, 505–519 (2011). https://doi.org/10.1007/s10898-010-9615-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-010-9615-8

Keywords

Mathematics Subject Classification (2000)

Search

Navigation