We present a short survey of multigrid--based solvers for symmetric eigenvalue problems. We concentrate our attention on ``of the shelf'' and ``black box'' methods, which should allow solving eigenvalue problems with minimal, or no, effort on the part of the developer, taking advantage of already existing algorithms and software. We consider a class of such methods, where the multigrid only appears as a black-box tool of constructing the preconditioner of the stiffness matrix, and the base iterative algorithm is one of well-known of-the-shelf preconditioned gradient methods such as the locally optimal block preconditioned conjugate gradient method. We review some known theoretical results for preconditioned gradient methods that guarantee the optimal, with respect to the grid size, convergence speed. Finally, we present results of numerical tests, which demonstrate practical effectiveness of our approach for the locally optimal block conjugate gradient method preconditioned by the standard V-cycle multigrid applied to the stiffness matrix.