Semilocal Lipschitz stability in linear optimization
This talk has its core in variational analysis, a vast and modern mathematical field
closely related to optimization. In general terms, the main original contributions presented in this talk are concerned with linear optimization problems in different parametric settings and their associated feasible and optimal set (argmin) mappings. More specifically, we are interested in Lipschitz type properties associated to those mappings, together with the corresponding moduli. Additionaly, some insights on how this results affect feasibility will be shared.
Keywords: Variational analysis linear programming convex analysis feasible set mapping argmin mapping Hoffman constants Lipschitz upper semicontinuity calmness radius of metric subregularity paramonotone operators distance to feasibility