Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Lipschitz upper semicontinuity of linear inequality systems under full perturbations (2505.02575v1)

Published 5 May 2025 in math.OC

Abstract: The present paper is focused on the computation of the Lipschitz upper semicontinuity modulus of the feasible set mapping in the context of fully perturbed linear inequality systems; i.e., where all coefficients are allowed to be perturbed. The direct antecedent comes from the framework of right-hand side (RHS, for short) perturbations. The difference between both parametric contexts, full vs RHS perturbations, is emphasized. In particular, the polyhedral structure of the graph of the feasible set mapping in the latter framework enables us to apply classical results as those of Hoffman [A. J. HOFFMAN, J. Res. Natl. Bur. Stand. 49 (1952), pp. 263--265] and Robinson [S. M. ROBINSON, Math. Progr. Study 14 (1981), pp. 206--214]. In contrast, the graph of the feasible set mapping under full perturbations is no longer polyhedral (not even convex). This fact requires ad hoc techniques to analyze the Lipschitz upper semicontinuity property and its corresponding modulus.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com