The S-Procedure via Dual Cone Calculus
Optimization and Control
2013-05-14 v1
Abstract
Given a quadratic function that satisfies a Slater condition, Yakubovich's S-Procedure (or S-Lemma) gives a characterization of all other quadratic functions that are copositive with in a form that is amenable to numerical computations. In this paper we present a deep-rooted connection between the S-Procedure and the dual cone calculus formula , which holds for closed convex cones in . To establish the link with the S-Procedure, we generalize the dual cone calculus formula to a situation where is nonclosed, nonconvex and nonconic but exhibits sufficient mathematical resemblance to a closed convex cone. As a result, we obtain a new proof of the S-Lemma and an extension to Hilbert space kernels.
Cite
@article{arxiv.1305.2444,
title = {The S-Procedure via Dual Cone Calculus},
author = {Raphael Hauser},
journal= {arXiv preprint arXiv:1305.2444},
year = {2013}
}