About properties of the mean value functional and of the continuous infimal convolution in stochastic convex analysis

  • Hiriart-Urruty Jean-Baptiste
Optimal Control Stochastic
Part of the Lecture Notes in Computer Science book series (LNCS, volume 41)


In stochastic convex programming numerous examples are to be found where the cost functional to be minimized is of the form of a mean value functional Ef(x)=εΩ f (x, ω) dP (ω) where × ɛ ℝn and ω is an uncertain quantity-element of a probability space. The problem of minimizing Ef is a deterministic problem related to the stochastic convex program. To be able to apply the methods of convex optimization and the theorems of convex analysis, it is important to know the properties of Ef, both topological and algebraic. The aim of this paper is to determine the main properties and characteristics of the mean value functional Ef resulting from these corresponding to the functions f (., ω). By the conjugacy operation, the mean value functional is closely related to the continuous infimal convolution of which we shall also give some properties. Finally the different results obtained are applied to stochastic optimization problems.


Multivalued Mapping Stochastic Optimization Problem Normal Convex Exposed Point Integrable Selector 


  1. [1]
    D.P. BERTSEKAS, Stochastic optimization problems with non differentiable cost functionals. Journal of Optimization Theory and Applications. 1973, Vol. 12, no 2, p. 218–231.Google Scholar
  2. [2]
    A.D. IOFFE-V.M. TIHOMIROV, Dualité des fonctions convexes et problèmes d'extrêmum. Uspehi Mat. N. 23-6 (1968) p. 51–116.Google Scholar
  3. [3]
    P.J. LAURENT, Approximation et optimisation, Hermann, Paris 1972.Google Scholar
  4. [4]
    C. LEMARECHAL, Sur les méthodes de gradient conjugué appliquées aux critères non différentiables.C.R. Acad. Sc. Paris, t. 278 (1974).Google Scholar
  5. [5]
    J. NEVEU, Bases mathématiques du Calcul des Probabilités. Masson, Paris 1970.Google Scholar
  6. [6]
    R.T. ROCKAFELLAR, Integrals which are convex functionals. Pacific Journal of Mathematics 1968. Vol. 24, no 3, p. 525–539.Google Scholar
  7. [7]
    R.T. ROCKAFELLAR, Measurable dependance of convex sets and functions on parameters. Journal of Mathematical Analysis and applications, 1969, 28, p. 4–25.Google Scholar
  8. [8]
    R.T. ROCKAFELLAR, Convex analysis. Princeton 1970.Google Scholar
  9. [9]
    R.T. ROCKAFELLAR, Conjugate duality and optimization, Lecture Notes, Série no 16, SIAM Publications, 1974.Google Scholar
  10. [10]
    R.T. ROCKAFELLAR, R.J.B. WETS, Stochastic convex programming: Basic Duality. Pacific Journal of Mathematics (to appear)Google Scholar
  11. [11]
    M. VALADIER, Multiapplications mesurables à valeurs convexes compactes, Journal de Mathématiques Pures et Appliquées 50, 1971, p. 265–297.Google Scholar
  12. [12]
    M. VALADIER, Intégration d'ensembles convexes fermés, notamment d'épigraphes. Rev. Franç. Inf. Rech. Op. 4 (1970) p. 57–73.Google Scholar
  13. [13]
    B. VAN CUTSEM, Eléments aléatoires à valeurs convexes compactes. Thèse Université de Grenoble, 1971.Google Scholar
  14. [14]
    D.W. WALKUP-R.J.B. WETS, Stochastic programs with recourse II: on the continuity of the objective. Siam J. Appl. Math. 1969, Vol. 17, no 1, p. 98–103.Google Scholar
  15. [15]
    R.J.B. WETS, On inf-compact mathematical programs, Proceedings 5th I.F.I.P. Conference on optimization, Springer Verlag, (1974).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Hiriart-Urruty Jean-Baptiste
    • 1
  1. 1.Département de Mathématiques AppliquéesUniversité de ClermontAubiere

Personalised recommendations