Erd\H{o}s' minimum overlap problem

We obtain a substantially improved lower bound for the minimum overlap problem asked by Erd\H{o}s. Our approach uses elementary Fourier analysis to translate the problem to a convex optimization program.