Abstract:In this paper we construct a minimizing sequence for the problem (1). In particular, we show that for any subsolution of the Hamilton-Jacobi equation $(\ast )$ there exists a minimizing sequence weakly convergent to this subsolution. The variational problem (1) arises from the theory of computer vision equations.
Keywords: Young measures, computer vision equations
AMS Subject Classification: 49R, 35E