Here is a draft showing how one can calculate solutions with an approximation guarantee for the whole range of regularization parameters for support vector machines, and other parameterized optimization problems defined over the unit simplex.
A conference version of this work will shortly appear as "Approximating Parameterized Convex Optimization Problems" in ESA 2010.