Linear semi-infinite optimization (LSIO) deals with linear optimization problems in which
either the dimension of the decision space or the number of constraints (but not both) is …

Using techniques of variational analysis, necessary and sufficient subdifferential conditions
for Hölder error bounds are investigated and some new estimates for the corresponding …

The main difficulty for solving semi-infinite programming (SIP) problem is precisely that it has
infinitely many constraints. By using a maximum function, the SIP problem can be rewritten …

Semi-infinite problem (SIPs) are widely used in many control systems for solving complex
control problem, such as polymerase chain reaction control system or other real time control …

This article continues the investigation of stationarity and regularity properties of infinite
collections of sets in a Banach space started in Kruger and López (J. Optim. Theory Appl …

In this paper, we study a semi-infinite programming (SIP) problem with a convex set
constraint. Using the value function of the lower level problem, we reformulate SIP problem …

We propose a unifying general framework of quantitative primal and dual sufficient and
necessary error bound conditions covering linear and nonlinear, local and global settings …

This paper provides operative point-based formulas (only involving the nominal data, and
not data in a neighborhood) for computing or estimating the calmness modulus of the …

This paper is devoted to the study of the stability of the solution map for the parametric
convex semi-infinite optimization problem under convex function perturbations in short …

This paper is a kind of biased survey of the most representative and recent results on
stability for the linear optimization problem. Qualitative and quantitative approaches are …