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

Authors:
L. Bayón;J. M. Grau;M. M. Ruiz;P. M. Suárez
Affiliations:
-;-;-;-
Venue:
Journal of Computational and Applied Mathematics
Year:
2012

Citing 3
Cited 0

Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources

Mathematics of Operations Research
Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations

Computational Optimization and Applications
New developments on equivalent thermal in hydrothermal optimization: an algorithm of approximation

Journal of Computational and Applied Mathematics - Special issue: Selected papers of the international conference on computational methods in sciences and engineering (ICCMSE-2003)

Quantified Score

Hi-index	7.29

Visualization

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.