Convex optimization problems arising in applications, possibly as approx- imations of intractable problems, are often structured and large scale. When the data are noisy, it is of interest to bound the solution error relative to the (unknown) solu- tion of the original noiseless problem. Related to