 However, it is straightforward to calculate an approximation to the geometric median using an iterative procedure in which each step produces a more accurate approximation.Procedures of this type can be derived from the fact that the sum of distances to the sample points is a convex function, since the distance to each sample point is convex and the sum of convex functions remains convex.Therefore, procedures that decrease the sum of distances at each step cannot get trapped in a local optimum.