  In this paper, we study parametric analysis of semidefinite optimization
problems w.r.t. the perturbation of the objective function. We study the
behavior of the optimal partition and optimal set mapping on a so-called
nonlinearity interval. Furthermore, we investigate the sensitivity of the
approximation of the optimal partition in a nonlinearity interval, which has
been recently studied by Mohammad-Nezhad and Terlaky. The approximation of the
optimal partition was obtained from a bounded sequence of interior solutions
on, or in a neighborhood of the central path. We derive an upper bound on the
distance between the approximations of the optimal partitions of the original
and perturbed problems. Finally, we examine the theoretical bounds by way of
experimentation.
