Abstract
This article studies the minimization of the functional among all convex functions that satisfy the additional obstacle constraint , , where is a given convex function. We first show that this nonconvex problem is in fact equivalent to a linear programming problem. This enables us to establish a necessary and sufficient optimality condition.
References
- Y. Brenier: Polar factorization and monotone rearrangements of vector valued functions, Commun. Pure Appl. Math. 44 (1991) 375–417.https://doi.org/10.1002/cpa.3160440402Google Scholar
- F. Brock, V. Ferone, B. Kawohl: A symmetry problem in the calculus of variations, Calc. Var. Partial Differ. Equ. 4 (1996) 71–89.https://doi.org/10.1007/BF01261764Google Scholar
- I. Ekeland, R. Temam: Convex Analysis and Variational Problems, North-Holland (1972).Google Scholar
- T. Lachand-Robert, M. A. Peletier: Extremal points of a functional on the set of convex functions, Proc. Amer. Math. Soc. 127 (1999) 1723–1727.https://doi.org/10.1090/S0002-9939-99-05209-0Google Scholar
- S. Mazur: Über konvexe Mengen in linearen normierten Räumen, Stud. Math. 4 (1933) 70–84.https://doi.org/10.4064/sm-4-1-70-84Google Scholar
- P.-A. Meyer: Probabilités et Potentiel, Hermann, Paris (1966).Google Scholar
- J. Mossino: Inégalités Isopérimétriques et Applications en Physique, Hermann, Paris (1984).Google Scholar
- R. R. Phelps: Convex Functions, Monotone Operators and Differentiability, Lect. Notes Math. 1364, 2nd Ed., Springer (1993).Google Scholar
- J.-C. Rochet, P. Choné: Ironing, sweeping and multidimensional screening, Econometrica 66 (1998) 783–826.https://doi.org/10.2307/2999574Google Scholar
- R. T. Rockafellar: Convex Analysis, Princeton University Press (1970).https://doi.org/10.1515/9781400873173Google Scholar
Suggested citation
Published by Heldermann Verlag, 2004. Rights now held by Banach Press LLC.
