An $L^1$ Penalty Method for General Obstacle Problems

From MaRDI portal
Publication:5264051

DOI10.1137/140963303zbMath1328.35336arXiv1404.1370OpenAlexW2093346147MaRDI QIDQ5264051

Giang Tran, William M. Feldman, Hayden Schaeffer, Stanley J. Osher

Publication date: 20 July 2015

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.1370



Related Items

Global higher integrability for minimisers of convex obstacle problems with (p,q)-growth, Projection Method for Droplet Dynamics on Groove-Textured Surface with Merging and Splitting, Extracting Sparse High-Dimensional Dynamics from Limited Data, A FEM approximation of a two-phase obstacle problem and its a posteriori error estimate, An efficient primal-dual method for the obstacle problem, Fast operator splitting methods for obstacle problems, Additive Schwarz Methods for Convex Optimization as Gradient Methods, Extracting Structured Dynamical Systems Using Sparse Optimization With Very Few Samples, Accurate and efficient numerical solutions for elliptic obstacle problems, Forward stability of ResNet and its variants, Learning partial differential equations via data discovery and sparse optimization, Convergence of the finite difference scheme for a general class of the spatial segregation of reaction-diffusion systems, A numerical approach for a general class of the spatial segregation of reaction-diffusion systems arising in population dynamics, Sparse + low-energy decomposition for viscous conservation laws, Equivalent extensions of partial differential equations on surfaces, Penalty methods for one-sided parabolic problems with piecewise smooth obstacles, A Modified Split Bregman Algorithm for Computing Microstructures Through Young Measures, On exact penalty operators and penalization methods for elliptic unilateral problems with piecewise smooth obstacles, PDE acceleration: a convergence rate analysis and applications to obstacle problems, Two neural-network-based methods for solving elliptic obstacle problems


Uses Software


Cites Work