Conforming approximation of convex functions with the finite element method

DOI10.1007/s00211-017-0884-8zbMath1385.65043OpenAlexW2616320780MaRDI QIDQ1679216

Gerd Wachsmuth

Publication date: 8 November 2017

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-017-0884-8

zbMATH Keywords

optimizationtriangulationconvergencenumerical resultserror estimatesapproximationconvex functionsconvexity constraintsconforming discretizationfinite element functions

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Approximation methods and heuristics in mathematical programming (90C59) Numerical methods based on nonlinear programming (49M37) Existence theories for optimal control problems involving partial differential equations (49J20)

Related Items (5)

Numerical approximation of optimal convex and rotationally symmetric shapes for an eigenvalue problem arising in optimal insulation ⋮ Two-scale method for the Monge-Ampère equation: Convergence to the viscosity solution ⋮ Numerical Approximation of Optimal Convex Shapes ⋮ Convergent Two-Scale Filtered Scheme for the Monge--Ampère Equation ⋮ Linear-Time Convexity Test for Low-Order Piecewise Polynomials

Uses Software

• PENNON
• Mosek

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive, anisotropic and hierarchical cones of discrete convex functions
• The numerical solution of Newton's problem of least resistance
• Discretization of functionals involving the Monge-Ampère operator
• On Newton's problem of minimal resistance
• Two problems in economics
• An algorithm for computing solutions of variational problems with global convexity constraints
• NON-CONVERGENCE RESULT FOR CONFORMAL APPROXIMATION OF VARIATIONAL PROBLEMS SUBJECT TO A CONVEXITY CONSTRAINT
• PENNON: Software for Linear and Nonlinear Matrix Inequalities
• DELAUNAY STABILITY VIA PERTURBATIONS
• On Convex Functions and the Finite Element Method
• Polar factorization and monotone rearrangement of vector‐valued functions
• Error Estimates for the Approximation of a Class of Variational Inequalities
• On second derivates of convex functions.
• The Variational Formulation of the Fokker--Planck Equation
• PENNON: A code for convex nonlinear and semidefinite programming
• Ironing, Sweeping, and Multidimensional Screening
• Minimum Problems over Sets of Concave Functions and Related Questions
• A Numerical Method for Variational Problems with Convexity Constraints
• Handling Convexity-Like Constraints in Variational Problems
• Minimizing within Convex Bodies Using a Convex Hull Method
• Acute triangulations of polygons
• A symmetry problem in the calculus of variations
• A numerical approach to variational problems subject to convexity constraint
• Acute triangulations of polygons

This page was built for publication: Conforming approximation of convex functions with the finite element method