A previously proposed nonlinear inverse reconstruction for autocalibrated parallel imaging simultaneously estimates coil sensitivities and image content. This work exploits this property for real-time MRI, where coil sensitivities need to be dynamically adapted to the conditions generated by moving objects. The development comprises (i) an extension of the nonlinear inverse algorithm to non-Cartesian k-space encodings, (ii) its implementation on a graphical processing unit to reduce reconstruction times, and (iii) the use of a convolution-based iteration, which considerably simplifies the graphical processing unit implementation compared to a gridding technique. The method is validated for real-time MRI of the human heart at 3 T using radio frequency-spoiled radial FLASH ( Recently, nonlinear algorithms for improved autocalibrated parallel imaging (1,2) have been described, which combine the use of variable density trajectories with the joint estimation of image content and coil sensitivities. For the algorithm presented in Uecker et al. (2), it could also be shown that only a very small central k-space area with full sampling is required for accurate autocalibration. Both properties are particularly attractive for real-time imaging, where the coil sensitivity information has to be frequently updated to match the actual experimental situation generated by a moving object. A further strength of the algorithm is its inherent flexibility, which allows for arbitrary sampling patterns and k-space trajectories. In fact, the specific application to a radial trajectory leads to a completely selfcontained reconstruction process, so that the real-time data can be processed without any special calibration of the coil sensitivities.In order to apply a nonlinear inverse reconstruction to non-Cartesian k-space data, it has been proposed to add an interpolation step to each iteration of the algorithm (3). Because such computations are rather slow, one may consider the use of a graphical processing unit (GPU) to achieve reasonable reconstruction times. A corresponding implementation for iterative SENSE (4) has indeed been utilized for real-time imaging (5). However, an efficient implementation of the interpolation algorithm on a GPU is a difficult and time-consuming task. The present work therefore describes an alternative solution. The extension of our previous work (2) to a non-Cartesian radial trajectory is accomplished by only a single interpolation performed in a preparatory step, while the subsequent iterative optimization relies on a convolution with the point-spread function. Although this idea has also been proposed for iterative SENSE (6), it was not found to be faster than the interpolation technique (7). However, in terms of computational demand and in contrast to an interpolation, a convolution mainly involves two applications of a fast Fourier transform algorithm. It therefore allows for a very simple GPU implementation, which then may be exploited to realize considerable reductions of the reconstruction time. To ...