In this paper we present a methodology to obtain converging lower and upper bounds to a multiple objective problem where an H-2 performance objective is minimized subject to an l(1) constraint. This methodology gives a computationally efficient synthesis procedure by avoiding many of the problems that are present in methods that employ zero interpolation techniques to characterize achievable closed loop maps.