Robust generalized S-procedure revisited with applications to robust optimization problems

BMC Marine Science · Springer Nature · 2026-09-26 · DOI: 10.1007/s11750-026-00731-8

Аннотация

The classic S -procedure can be seen as an extension of the Farkas lemma from affine to quadratic functions characterizing when a concave quadratic function F is nonnegative on the solution set of a system of convex quadratic inequalities. This procedure can be extended in many directions. In this paper, the decision space X is infinite dimensional, and the function F is replaced by the supremum of a family of uncertain functions $$\left\{ F_{u},u\in U\right\} ,$$ where U is an uncertain set, and the corresponding robust S -procedure consists in the characterization of the nonnegativity of that supremum on X . The paper also studies a new type of procedure which is stable w.r.t. a class of convex functions. The new results are applied to obtain robust Farkas lemmas and to get optimality and duality theorems for robust optimization problems.

Читать у издателя →

Похожие статьи