The method of convex programming with a prescribed absolute-relative error (Q1571209)

Questions concerning the effectiveness of optimization methods, their theoretical rates of convergence, and the solution errors are considered. A finite method for solving a convex programming problem with a given absolute-relative error is proposed. The method represents a further development of earlier suggested methods for solving this problem with given absolute and relative errors.