A fresh geometrical look at the general S-procedure
Let \(f_{i}:\mathbb{R}^{n}\rightarrow \mathbb{R}\) (\(i=0,1,...,p\)), and set \( \mathcal{F}:=Im(f_{0},-f_{1},\ldots,-f_{p})\). The main result establishes that, if there exists \(x_{0}\in \mathbb{R}^{n}\) such that \( f_{i}(x_{0})>0\) (\(i=0,1,\ldots,p\)), there exists a set \(\mathcal{Z\subset } \mathbb{R}^{p+1}\) containing \(0\) and such that \(\mathbb{R}_{+}(\mathcal{F}+ \mathcal{Z})\) is convex, and the implication \[ f_{i}(x)\geq 0\text{ for all }i=1,\ldots,p\Rightarrow f_{0}(x)\geq 0 \] holds true, then there exist \(\alpha _{i}\geq 0\) (\(i=0,1,\ldots,p\)) such that \( f_{0}(x)\geq \sum\limits_{i=1}^{p}f_{i}(x)\) for all \(x\in \mathbb{R}^{n}\).
- A Survey of the S-Lemma
- Characterizing the convexity of joint-range for a pair of inhomogeneous quadratic functions and strong duality
- Convexity of quadratic transformations and its use in control and optimization
- Duality theorems for certain nonconvex extremal problems
- Kalman-Popov-Yakubovich Lemma and the \(S\)-procedure: a historical essay
- On the S-procedure and some variants
- Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
- Geometric properties for level sets of quadratic functions
- scientific article; zbMATH DE number 4213759 (Why is no real title available?)
- Generalized $\mathcal{S}$-Procedure for Inequality Conditions on One-Vector-Lossless Sets and Linear System Analysis
- General formulation of the S-procedure
- Convexifiable quadratic inequality systems: new minimax S-lemma and exact SOCPs for classes of distributionally robust optimization problems
- On the S-procedure and some variants
This page was built for publication: A fresh geometrical look at the general S-procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128764)