Large deformation diffeomorphic metric mapping (LDDMM) is a popular approach for deformable image registration with nice mathematical properties. LDDMM encodes spatial deformations through time-varying velocity fields. Hence registration requires optimization over these time-varying velocity fields, resulting in a large-scale constrained optimization problem. Typical numerical solution approaches for LDDMM use an optimize–discretize strategy, where optimality conditions are derived in the continuum and subsequently discretized and solved. Here we explore solution methods based on the discretize–optimize approach and discuss ramifications for popular LDDMM relaxation and shooting approaches. The focus is on a consistent method that uses the appropriate Runge–Kutta methods for the solution of all arising PDEs in the Eulerian frame. Additionally, we discuss both run-time and memory consumption requirements and present an approach that makes the registration suitable for standard PCs. We demonstrate the practicality of our proposed approach in the context of image registration applied to 3D computed tomography (CT) scans of the lung.