Computing the level set convex hull

DOI10.1007/s10915-017-0522-8zbMath1398.65261OpenAlexW2744961039MaRDI QIDQ1747026

Bilal Abbasi, Adam M. Oberman

Publication date: 26 April 2018

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-017-0522-8

zbMATH Keywords

finite difference methodquasiconvexityconvexitypartial differential equationlevel set methodviscosity solutionsgeneralized convex envelopes

Mathematics Subject Classification ID

Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite difference methods for boundary value problems involving PDEs (65N06) Viscosity solutions to Hamilton-Jacobi equations in optimal control and differential games (49L25) Numerical methods for variational inequalities and related problems (65K15)

Related Items (2)

A relaxation result in the vectorial setting and power law approximation for supremal functionals ⋮ Convex and quasiconvex functions in metric graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The quasiconvex envelope through first-order partial differential equations which characterize quasiconvexity of nonsmooth functions
• A partial differential equation for the rank one convex envelope
• A convergent monotone difference scheme for motion of level sets by mean curvature
• A uniqueness result for the quasiconvex operator and first order PDEs for convex envelopes
• Rearrangements and convexity of level sets in PDE
• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• Generalized concavity
• A level set approach to the wearing process of a nonconvex stone
• Quasiconvex functions and nonlinear PDEs
• Exponential convergence for a convexifying equation
• Quasi-Concave Programming
• The convex envelope is the solution of a nonlinear obstacle problem
• COMPUTING THE CONVEX ENVELOPE USING A NONLINEAR PARTIAL DIFFERENTIAL EQUATION
• Shapes of worn stones
• Fast Marching Methods
• A method to convexify functions via curve evolution
• Quasi–concave envelope of a function and convexity of level sets of solutions to elliptic equations
• Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
• A fast sweeping method for Eikonal equations
• Convexity properties of solutions to some classical variational problems
• Image processing via level set curvature flow.
• Functions Which Are Quasiconvex under Linear Perturbations
• Convergent Difference Schemes for Degenerate Elliptic and Parabolic Equations: Hamilton--Jacobi Equations and Free Boundary Problems

This page was built for publication: Computing the level set convex hull