The pattern synthesis algorithm for arbitrary arrays using adaptive beamforming method is discussed. An improved iterative linear constraints least square algorithm is presented. The new algorithm exhibits numerical robust and can be used with random sparse arrays. The algorithm finds the best attainable pattern with the given array if the pattern specifications cannot be met. Numerical examples are presented to illustrate the performance of the algorithm.