A refined theorem concerning the conditioning of semidefinite programs

Using a weaker version of the Newton-Kantorovich theorem 6] given by us in 3], we show how to refine the results given in 8] dealing with the analyzing of the effect of small perturbations in problem data on the solution. The new results are obtained under weaker hypotheses and the same computational cost as in 8].