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