The S-Procedure via Dual Cone Calculus
Raphael Hauser

TL;DR
This paper explores a novel connection between the S-Procedure and dual cone calculus, extending the classical S-Lemma to more general settings including nonclosed, nonconvex cones and Hilbert space kernels.
Contribution
It introduces a new link between the S-Procedure and dual cone calculus, generalizes the dual cone formula, and provides an extended proof of the S-Lemma applicable to broader contexts.
Findings
Established a connection between the S-Procedure and dual cone calculus.
Generalized the dual cone formula to nonclosed, nonconvex sets.
Extended the S-Lemma to Hilbert space kernels.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Matrix Theory and Algorithms · Numerical Methods and Algorithms
