  A gradient projection method with feasible inexact projections is proposed in
the present paper. The inexact projection is performed using a relative error
tolerance. Asymptotic convergence analysis and iteration-complexity bounds of
the method employing constant and Armijo step sizes are presented. Numerical
results are reported illustrating the potential advantages of considering
inexact projections instead of exact ones in some medium scale instances of a
least squares problem over the spectrohedron.
