General formulation of the S-procedure

MaRDI QIDQ6620715

Moussa Barro, M. Volle

Publication date: 17 October 2024

Published in: Journal of Convex Analysis (Search for Journal in Brave)

zbMATH Keywords

Hahn-Banach theoremconjugacyS-lemmaseparation of setsFarkas type lemmaperturbational duality

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Farkas' lemma: three decades of generalizations for mathematical optimization
• On epsilon-stability in optimization
• On the S-procedure and some variants
• Conjugate duality in convex optimization
• A fresh geometrical look at the general S-procedure
• Duality theorems for certain nonconvex extremal problems
• Generalizations of Farkas’ Theorem
• Essays and Surveys in Global Optimization
• A Survey of the S-Lemma
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: General formulation of the S-procedure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6620715)