The feasible set of a convex semi-infinite program is described by a possib
ly infinite system of convex inequality constraints. We want to obtain an u
pper bound for the distance of a given point from this set in terms of a co
nstant multiplied by the value of the maximally violated constraint functio
n in this point. Apart from this Lipschitz case we also consider error boun
ds of Holder type, where the value of the residual of the constraints is ra
ised to a certain power.
We give sufficient conditions for the validity of such bounds, Our conditio
ns do not require that the Slater condition is valid. For the definition of
our conditions, we consider the projections on enlarged sets corresponding
to relaxed constraints. We present a condition in terms of projection mult
ipliers. a condition in terms of Slater points and a condition in terms of
descent directions. For the Lipschitz case, we give five equivalent charact
erizations of the validity of a global error bound.
We extend previous results in two directions: First, we consider infinite s
ystems of inequalities instead of finite systems, The second point is that
we do not assume that the Slater condition holds which has been required in
almost all earlier papers.