COMPUTING THE CONVEX ENVELOPE USING A NONLINEAR PARTIAL DIFFERENTIAL EQUATION
From MaRDI portal
Publication:3520456
DOI10.1142/S0218202508002851zbMath1154.35056WikidataQ115245867 ScholiaQ115245867MaRDI QIDQ3520456
Publication date: 26 August 2008
Published in: Mathematical Models and Methods in Applied Sciences (Search for Journal in Brave)
35J70: Degenerate elliptic equations
52A41: Convex functions and convex programs in convex geometry
65N06: Finite difference methods for boundary value problems involving PDEs
26B25: Convexity of real functions of several variables, generalizations
Related Items
Solving the Monge–Ampère equations for the inverse reflector problem, Techniques and Open Questions in Computational Convex Analysis, Bounding duality gap for separable problems with linear constraints, A partial differential equation for the rank one convex envelope, Fast finite difference solvers for singular solutions of the elliptic Monge-Ampère equation, An iterated projection approach to variational problems under generalized convexity constraints, Higher-order adaptive finite difference methods for fully nonlinear elliptic equations, Computing the level set convex hull, 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, Quasiconvex functions and nonlinear PDEs, The Dirichlet problem for the convex envelope, Two Numerical Methods for the elliptic Monge-Ampère equation
Uses Software
Cites Work
- Unnamed Item
- 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
- 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
