“…A non-exhaustive list of phase-only optimization approaches addressing all the individual phases of the array include gradient methods [2], [3], [19], integer programming [5], alternate projections [6], more recently semi-definite programming relaxations [7], the steepest descent method [8], [9], Taguchi method [10] and the non uniform FFT [11]. Furthermore, for these tough problems, evolutionary algorithm as particle swarm [12], [13], bat algorithm [14] or cross entropy [15] are usually preferred since they perform a global optimization, and do not easily get trapped in local minima, as deterministic techniques do, especially in complex non-convex optimization problems as the one faced here.…”