A fresh geometrical look at the general S-procedure

DOI10.1007/s11590-021-01789-yzbMath1494.90126arXiv2102.05886OpenAlexW3195933138WikidataQ114222155 ScholiaQ114222155MaRDI QIDQ2128764

Jean-Baptiste Hiriart-Urruty, Michel De Lara

Publication date: 22 April 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.05886

zbMATH Keywords

convexityS-lemma

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Cites Work

• Unnamed Item
• On the S-procedure and some variants
• Kalman-Popov-Yakubovich Lemma and the \(S\)-procedure: a historical essay
• Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
• Convexity of quadratic transformations and its use in control and optimization
• Duality theorems for certain nonconvex extremal problems
• A Survey of the S-Lemma

This page was built for publication: A fresh geometrical look at the general S-procedure