{"ID":2824807,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2512.22561","arxiv_id":"2512.22561","title":"Robust generalized S-Procedure","abstract":"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.","short_abstract":"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 exten...","url_abs":"https://arxiv.org/abs/2512.22561","url_pdf":"https://arxiv.org/pdf/2512.22561v1","authors":"[\"N. Dinh\",\"M. A. Goberna\",\"D. H. Long\",\"M. Volle\"]","published":"2025-12-27T11:18:43Z","proceeding":"math.OC","tasks":"[\"math.OC\"]","methods":"[]","has_code":false}