Numerische Mathematik

, Volume 137, Issue 3, pp 741–772 | Cite as

Conforming approximation of convex functions with the finite element method

  • Gerd WachsmuthEmail author


We consider the interior approximation of convex functions with convex finite element functions. The main motivation for this study is the investigation of a novel discretization of optimization problems with convexity constraints by the finite element method. Under a mild assumption on the family of meshes, we show that the conforming approximation is convergent if the finite elements are at least piecewise quadratic. We further provide similar results under additional constraints on the function values or on the gradient. The theoretical findings are illustrated by numerical examples.

Mathematics Subject Classification

65K10 65N30 



The author is indebted to the anonymous referees for many valuable comments and suggestions and for drawing his attention to [3].


  1. 1.
    Aguilera, N.E., Morin, P.: On convex functions and the finite element method. SIAM J. Numer. Anal. 47(4), 3139–3157 (2009). doi: 10.1137/080720917. ISSN: 0036-1429MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Benamou, J.-D., Carlier, G., Mérigot, Q., Oudet, É.: Discretization of functionals involving the Monge-Ampére operator. Numer. Math. 134(3), 611–636 (2016). doi: 10.1007/s00211-015-0781-y MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Boissonnat, J.-D., Dyer, R., Arijit, G.: Delaunay stability via perturbations. Int. J. Comput. Geom. Appl. 24(2), 125–152 (2014). doi: 10.1142/S021819591450006X. ISSN: 0218-1959MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Brenier, Y.: Polar factorization and monotone rearrangement of vectorvalued functions. Commun. Pure Appl. Math. 44(4), 375–417 (1991). doi: 10.1002/cpa.3160440402. ISSN: 0010-3640CrossRefzbMATHGoogle Scholar
  5. 5.
    Brenner, S., Scott, L.R.: The Mathematical Theory of Finite Element Methods, 2nd edn. Springer, New York (2002)CrossRefzbMATHGoogle Scholar
  6. 6.
    Brock, F., Ferone, V., Kawohl, B.: A symmetry problem in the calculus of variations. Calc. Var. Partial Differ. Equ. 4(6), 593–599 (1996). doi: 10.1007/BF01261764 MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Buttazzo, G., Ferone, V., Kawohl, B.: Minimum problems over sets of concave functions and related questions. Math. Nachr. 173, 71–89 (1995). doi: 10.1002/mana.19951730106 MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Buttazzo, G., Kawohl, B.: On Newton’s problem of minimal resistance. Math. Intell. 15(4), 7–12 (1993). doi: 10.1007/BF03024318 MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Carlier, G., Lachand-Robert, T., Maury, B.: A numerical approach to variational problems subject to convexity constraint. Numer. Math. 88(2), 299–318 (2001). doi: 10.1007/PL00005446. ISSN: 0029-599XMathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Choné, P., Le Meur, H.V.J.: Non-convergence result for conformal approximation of variational problems subject to a convexity constraint. Numerical Functional Analysis and Optimization. An. Int. J. 22(5–6), 529–547 (2001). doi: 10.1081/NFA-100105306. ISSN: 0163-0563zbMATHGoogle Scholar
  11. 11.
    Dudley, R.M.: On second derivatives of convex functions. Math. Scand. 41(1), 159–174 (1977). ISSN: 0025-5521MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Ekeland, I.: Two problems in economics. Jahresbericht der Deutschen Mathematiker-Vereinigung 104(2), 51–58 (2002). ISSN: 0012-0456MathSciNetzbMATHGoogle Scholar
  13. 13.
    Ekeland, I., Moreno-Bromberg, S.: An algorithm for computing solutions of variational problems with global convexity constraints. Numer. Math. 115(1), 45–69 (2010). doi: 10.1007/s00211-009-0270-2. ISSN: 0029-599XMathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Falk, R.S.: Error estimates for the approximation of a class of variational inequalities. Math. Comput. Simul. 28, 963–971 (1974). ISSN: 0378-4754MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Geiger, C., Kanzow, C.: Theorie und Numerik restringierter Optimierungsaufgaben. Springer, New York. (2002). doi: 10.1007/978-3-642-56004-0
  16. 16.
    Jordan, R., Kinderlehrer, D., Otto, F.: The variational formulation of the Fokker–Planck equation. SIAM J. Math. Anal. 29(1), 1–17 (1998). doi: 10.1137/S0036141096303359. ISSN: 0036-1410MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Kočvara, M., Stingl, M.: PENNON: a code for convex nonlinear and semidefinite programming. Optim. Methods Softw. 18(3), 317–333 (2003). doi: 10.1080/1055678031000098773. ISSN: 1055-6788MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Kočvara, M., Stingl, M.: “PENNON: a generalized augmented Lagrangian method for semidefinite programming”. In: High performance algorithms and software for nonlinear optimization (Erice, 2001), Vol. 82, pp. 303–321. Appl. Optim. Kluwer Acad. Publ., Norwell (2003). doi: 10.1007/978-1-4613-0241-4_14
  19. 19.
    Kocvara, Michal, Stingl, Michael: “PENNON: software for linear and nonlinear matrix inequalities”. In: Handbook on semidefinite, conic and polynomial optimization. Vol. 166, pp. 755–791. Internat. Ser. Oper. Res. Management Sci. Springer, New York (2012). doi: 10.1007/978-1-4614-0769-0_26
  20. 20.
    Lachand-Robert, T., Oudet, É.: Minimizing within convex bodies using a convex hull method. SIAM J. Optim. 16(2), 368–379 (2005). doi: 10.1137/040608039. (electronic). ISSN: 1052-6234MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Maehara, H.: Acute triangulations of polygons. Eur. J. Combin. 23(1), 45–55 (2002). doi: 10.1006/eujc.2001.0531. ISSN: 0195-6698MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Mérigot, Q., Oudet, É.: Handling convexity-like constraints in variational problems. SIAM J. Numer. Anal. 52(5), 2466–2487 (2014). doi: 10.1137/130938359. ISSN: 0036-1429MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Mirebeau, J.-M.: Adaptive, anisotropic and hierarchical cones of discrete convex functions. Numer. Math. 132(4), 807–853 (2016). doi: 10.1007/s00211-015-0732-7. ISSN: 0029-599XMathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    MOSEK ApS: The MOSEK optimization toolbox for MATLAB manual. Version 8.0 (Revision 57). (2017). URL:
  25. 25.
    Newton, I.: Philosophiæ Naturalis Principia Mathematica (1686)Google Scholar
  26. 26.
    Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, New York (2006). doi: 10.1007/978-0-387-40065-5 zbMATHGoogle Scholar
  27. 27.
    Oberman, A.: A numerical method for variational problems with convexity constraints. SIAM J. Sci. Comput. 35(1), A378–A396 (2013). doi: 10.1137/120869973 MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    Rochet, J.-C., Choné, P.: Ironing, sweeping, and multidimensional screening. Econometrica 66(4), 783–826 (1998). doi: 10.2307/2999574. ISSN: 00129682CrossRefzbMATHGoogle Scholar
  29. 29.
    Sottile, F.: Enumerative real algebraic geometry. In: Algorithmic and quantitative real algebraic geometry (Piscataway, NJ, 2001). Vol. 60. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pp. 139–179. Am. Math. Soc., Providence (2003)Google Scholar
  30. 30.
    Wachsmuth, G.: The numerical solution of Newton’s problem of least resistance. Math. Program. 147(1–2), 331–350 (2014). doi: 10.1007/s10107-014-0756-2 MathSciNetCrossRefzbMATHGoogle Scholar
  31. 31.
    Yuan, L.: Acute triangulations of polygons. Discrete Comput. Geom. 34(4), 697–706 (2005). doi: 10.1007/s00454-005-1188-9. ISSN: 0179-5376MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2017

Authors and Affiliations

  1. 1.Faculty of Mathematics, Professorship Numerical Mathematics (Partial Differential Equations)Technische Universität ChemnitzChemnitzGermany

Personalised recommendations