  We suggest simple modifications of the conditional gradient method for smooth
optimization problems, which maintain the basic convergence properties, but
reduce the implementation cost of each iteration essentially. Namely, we
propose the step-size procedure without any line-search, and inexact solution
of the direction finding subproblem. Preliminary results of computational tests
confirm efficiency of the proposed modifications.
