On one way tо design adaptive algorithms for solution of optimization problems with Boolean variables

The paper is concerned with formation of adaptive algorithms for solution of integer optimization problems. Randomization of the variables results in the possibility of solving an averaged problem instead. This approach permits interpreting the resultant algorithms in the ordinary gradient framework.