Article ID Journal Published Year Pages File Type
4639658 Journal of Computational and Applied Mathematics 2012 8 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Preview
A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions
Authors
, , , ,