A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions

In this paper we present an algorithm of quasi-linear complexity to exactly calculate the infimal convolution of convex quadratic functions. The algorithm exactly and simultaneously solves a separable uniparametric family of quadratic programming problems resulting from varying the equality constraint.