  In this paper, we consider gradient-type methods for convex positively
homogeneous optimization problems with relative accuracy. Estimates for the
quality of solution with relative accuracy are obtained for adaptive
non-accelerated and accelerated gradient-type methods for an analogue of the
recently proposed concept of inexact oracle. An analogue of the accelerated
universal gradient-type method for positively homogeneous optimization problems
with relative accuracy is discussed.
