The decomposition-coordination method for the $p(x)$-Laplacian

Abstract

In this paper we construct two algorithms to approximate the minimizer of a discrete functional which comes from using a discontinuous Galerkin method for a variational problem related to the $p(x)$-Laplacian. We also make some numerical experiments in dimension two.