Sampling from a real-valued distribution, whose density is nonsmooth and log-concave, is a computational issue that often arises in Machine Learning and Statistics. Langevin-based Hastings-Metropolis methods were proposed: they extend the Unadjusted Langevin Algorithm by using proximal methods to define a smoothed version of the density of interest. We consider the case when these extensions do not apply: the involved proximal operators do not have closed forms and the density is defined on a subset of the real numbers. We derive new Gaussian proposal mechanisms in a Metropolis Adjusted Langevin Algorithm, which use first-order information about the density function. We numerically compare these strategies and discuss the benefits of a change of geometry. The gain in using partial updates instead of global parameter updates is also illustrated.