Convex optimization with prescribed accuracy

A finite method is proposed for solving a convex programming problem with given error in the functional. Bounds are established for the number of iterations. A finite method is designed for solving a successive convex programming problem with concessions.