COMPUTING THE CONVEX ENVELOPE USING A NONLINEAR PARTIAL DIFFERENTIAL EQUATION

DOI10.1142/S0218202508002851zbMath1154.35056WikidataQ115245867 ScholiaQ115245867MaRDI QIDQ3520456

Adam M. Oberman

Publication date: 26 August 2008

Published in: Mathematical Models and Methods in Applied Sciences (Search for Journal in Brave)

zbMATH Keywords

finite difference methodpartial differential equationconvex envelope

Mathematics Subject Classification ID

Degenerate elliptic equations (35J70) Convex functions and convex programs in convex geometry (52A41) Finite difference methods for boundary value problems involving PDEs (65N06) Convexity of real functions of several variables, generalizations (26B25)

Related Items

Bounding duality gap for separable problems with linear constraints ⋮ Higher-order adaptive finite difference methods for fully nonlinear elliptic equations ⋮ Fast finite difference solvers for singular solutions of the elliptic Monge-Ampère equation ⋮ The Inverse Problem for Hamilton--Jacobi Equations and Semiconcave Envelopes ⋮ Computing the level set convex hull ⋮ Compensated convexity on bounded domains, mixed Moreau envelopes and computational methods ⋮ An iterated projection approach to variational problems under generalized convexity constraints ⋮ A partial differential equation for the rank one convex envelope ⋮ Two Numerical Methods for the elliptic Monge-Ampère equation ⋮ Techniques and Open Questions in Computational Convex Analysis ⋮ Finite difference methods for the infinity Laplace and \(p\)-Laplace equations ⋮ A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation ⋮ The Dirichlet problem for the convex envelope ⋮ Improved Accuracy of Monotone Finite Difference Schemes on Point Clouds and Regular Grids ⋮ Minimal convex extensions and finite difference discretisation of the quadratic Monge–Kantorovich problem ⋮ Quasiconvex functions and nonlinear PDEs ⋮ Solving the Monge–Ampère equations for the inverse reflector problem ⋮ Two-scale methods for convex envelopes

Uses Software

• na13

Cites Work

• Unnamed Item
• Unnamed Item
• A convergent monotone difference scheme for motion of level sets by mean curvature
• Variational methods on the space of functions of bounded Hessian for convexification and denoising
• On Newton's problem of minimal resistance
• On functional separately convex hulls
• Faster than the fast Legendre transform, the linear-time Legendre transform
• Characterization and approximation of the convex envelope of a function
• A fast computational algorithm for the Legendre-Fenchel transform
• Newton's Problem of the Body of Minimal Resistance in the Class of Convex Developable Functions
• Differentiability of convex envelopes
• The convex envelope is the solution of a nonlinear obstacle problem
• User’s guide to viscosity solutions of second order partial differential equations
• Identification du cône dual des fonctions convexes et applications
• A method to convexify functions via curve evolution
• Numerical Computation of Rank-One Convex Envelopes
• Approximated Convex Envelope of a Function
• Ironing, Sweeping, and Multidimensional Screening
• A convergent difference scheme for the infinity Laplacian: construction of absolutely minimizing Lipschitz extensions
• Minimizing within Convex Bodies Using a Convex Hull Method