Robust Generalized S-Procedure

doi:10.1007/s10013-026-00791-0

Robust Generalized S-Procedure

2026-02-01

0

PRE

AI

DOI：10.1007/s10013-026-00791-0

Original

Original request for help

Save

Abstract

En 中文

We introduce in this paper the so-called robust generalized S-procedure associated with a given robust optimization problem. We provide a primal characterization for the validity of this procedure as well as a dual characterization under the assumption that the decision space is locally convex. We also analyze an extension of the mentioned robust S-procedure that incorporates a right-hand side function.

Keywords:

S-procedure

Robust optimization

Perturbational duality

Conjugacy

Hahn-Banach theorem

Robust Generalized S-Procedure

Abstract

Journal

Organization