Abstract
In this paper, an algorithm for solving a special convex programming problem (CPP) is proposed. We consider a CPP with an objective function whose values and gradients are not easy to calculate. Algorithm for infinite feasible sets is developed.