N. E. Aguilera and P. Morin, Approximating optimization problems over convex functions, ANR-12-MONU-0013), pp.1-34, 2008.
DOI : 10.1007/s00211-008-0176-4

H. H. Bauschke and P. L. Combettes, A Dykstra-like algorithm for two monotone operators, Pac. J. Optim, vol.4, issue.3, pp.383-391, 2008.

H. H. Bauschke and A. S. Lewis, Dykstras algorithm with bregman projections: A convergence proof, Optimization, vol.142, issue.4, pp.409-427, 2000.
DOI : 10.1007/BF01581245

J. F. Bonnans, J. C. Gilbert, C. Lemaréchal, and C. A. Sagastizábal, Numerical optimization . Universitext, Theoretical and practical aspects, 2006.

J. P. Boyle and R. L. Dykstra, A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces, Advances in order restricted statistical inference, pp.28-47, 1985.
DOI : 10.1007/978-1-4613-9940-7_3

Y. Brenier, Polar factorization and monotone rearrangement of vector-valued functions, Communications on Pure and Applied Mathematics, vol.117, issue.4, pp.375-417, 1991.
DOI : 10.1002/cpa.3160440402

F. Brock, V. Ferone, and B. Kawohl, A symmetry problem in the calculus of variations, Calculus of Variations and Partial Differential Equations, vol.173, issue.6, pp.593-599, 1996.
DOI : 10.1007/BF01261764

G. Buttazzo, V. Ferone, and B. Kawohl, Minimum Problems over Sets of Concave Functions and Related Questions, Mathematische Nachrichten, vol.2, issue.1, pp.71-89, 1995.
DOI : 10.1002/mana.19951730106

G. Buttazzo and P. Guasoni, Shape optimization problems over classes of convex domains, J. Convex Anal, vol.4, issue.2, pp.343-351, 1997.

G. Carlier, A general existence result for the principal-agent problem with adverse selection, Journal of Mathematical Economics, vol.35, issue.1, pp.129-150, 2001.
DOI : 10.1016/S0304-4068(00)00057-4

G. Carlier, Calculus of variations with convexity constraint, J. Nonlinear Convex Anal, vol.3, issue.2, pp.125-143, 2002.

G. Carlier and A. Galichon, Exponential convergence for a convexifying equation, ESAIM: Control, Optimisation and Calculus of Variations, vol.18, issue.3, pp.611-620, 2012.
DOI : 10.1051/cocv/2011163
URL : https://hal.archives-ouvertes.fr/hal-00637398

G. Carlier and T. Lachand-robert, Regularity of solutions for some variational problems subject to a convexity constraint, Communications on Pure and Applied Mathematics, vol.28, issue.5, pp.583-594, 2001.
DOI : 10.1002/cpa.3

G. Carlier, T. Lachand-robert, and B. Maury, A numerical approach to variational problems subject to convexity constraint, Numerische Mathematik, vol.88, issue.2, pp.299-318, 2001.
DOI : 10.1007/PL00005446

P. Choné and H. V. Le-meur, NON-CONVERGENCE RESULT FOR CONFORMAL APPROXIMATION OF VARIATIONAL PROBLEMS SUBJECT TO A CONVEXITY CONSTRAINT, Numerical Functional Analysis and Optimization, vol.41, issue.5-6, pp.5-6529, 2001.
DOI : 10.2307/2999574

P. L. Combettes, Iterative construction of the resolvent of a sum of maximal monotone operators, J. Convex Anal, vol.16, issue.3-4, pp.727-748, 2009.

R. L. Dykstra, An Algorithm for Restricted Least Squares Regression, Journal of the American Statistical Association, vol.29, issue.384, pp.837-842, 1983.
DOI : 10.1080/01621459.1983.10477029

I. Ekeland and S. Moreno-bromberg, An algorithm for computing solutions of variational problems with global convexity constraints, Numerische Mathematik, vol.66, issue.2, pp.45-69, 2010.
DOI : 10.1007/s00211-009-0270-2

A. Figalli, Y. Kim, and R. J. Mccann, When is multidimensional screening a convex program?, Journal of Economic Theory, vol.146, issue.2, pp.454-478, 2011.
DOI : 10.1016/j.jet.2010.11.006

T. Lachand-robert and M. A. Peletier, An example of non-convex minimization and an application to Newton's problem of the body of least resistance, Annales de l'Institut Henri Poincare (C) Non Linear Analysis, vol.18, issue.2, pp.179-198, 2001.
DOI : 10.1016/S0294-1449(00)00062-7

J. Lamboley, A. Novruzi, and M. Pierre, Regularity and Singularities of Optimal Convex Shapes in the Plane, Archive for Rational Mechanics and Analysis, vol.2, issue.2, pp.311-343, 2012.
DOI : 10.1007/s00205-012-0514-7
URL : https://hal.archives-ouvertes.fr/hal-00651557

P. Lions, Identification du cône dual des fonctions convexes et applications. Comptes Rendus de l'Académie des Sciences-Series I-Mathematics, pp.1385-1390, 1998.

G. Loeper, On the regularity of solutions of optimal transportation problems, Acta Mathematica, vol.202, issue.2, pp.241-283, 2009.
DOI : 10.1007/s11511-009-0037-8

X. Ma, N. S. Trudinger, and X. Wang, Regularity of Potential Functions of the Optimal Transportation Problem, Archive for Rational Mechanics and Analysis, vol.13, issue.2, pp.151-183, 2005.
DOI : 10.1007/s00205-005-0362-9

Q. Mérigot and É. Oudet, Handling Convexity-Like Constraints in Variational Problems, SIAM Journal on Numerical Analysis, vol.52, issue.5, pp.2466-2487, 2014.
DOI : 10.1137/130938359

J. Mirebeau, Adaptive, anisotropic and hierarchical cones of discrete convex functions. arXiv preprint, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00943096

A. M. Oberman, The convex envelope is the solution of a nonlinear obstacle problem, Proceedings of the American Mathematical Society, vol.135, issue.06, pp.1689-1694, 2007.
DOI : 10.1090/S0002-9939-07-08887-9

A. M. Oberman, COMPUTING THE CONVEX ENVELOPE USING A NONLINEAR PARTIAL DIFFERENTIAL EQUATION, Mathematical Models and Methods in Applied Sciences, vol.18, issue.05, pp.759-780, 2008.
DOI : 10.1142/S0218202508002851

A. M. Oberman, A Numerical Method for Variational Problems with Convexity Constraints, SIAM Journal on Scientific Computing, vol.35, issue.1, pp.378-396, 2013.
DOI : 10.1137/120869973

J. Rochet and P. Choné, Ironing, Sweeping, and Multidimensional Screening, Econometrica, vol.66, issue.4, pp.783-826, 1998.
DOI : 10.2307/2999574

R. T. Rockafellar, Convex analysis. Princeton Mathematical Series, 1970.

L. Vese, A method to convexify functions via curve evolution, Communications in Partial Differential Equations, vol.15, issue.1, pp.1573-1591, 1999.
DOI : 10.1080/03605309908821476