Higher Degree Inexact Model for Optimization problems

In this paper, it was proposed a new concept of the inexact higher degree (, L, q) -model of a function that is a generalization of the inexact (, L) -model, (, L) -oracle and (, L) -oracle of degree q [0, 2). Some examples were provided to illustrate the proposed new model. Adaptive inexact gradient and fast gradient methods for convex and strongly convex functions were constructed and analyzed using the new proposed inexact model. A universal fast gradient method that allows solving optimization problems with a weaker level of smoothness, among them non-smooth problems was proposed. For convex optimization problems it was proved that the proposed gradient and fast gradient methods could be converged with rates O (1k + k^{q/2}) and O (1k² + k^{ (3q-2) /2}), respectively. For the gradient method, the coefficient of diminishes with k, and for the fast gradient method, there is no error accumulation for q 2/3. It proposed a definition of an inexact higher degree oracle for strongly convex functions and a projected gradient method using this inexact oracle. For variational inequalities and saddle point problems, a higher degree inexact model and an adaptive method called Generalized Mirror Prox to solve such class of problems using the proposed inexact model were proposed. Some numerical experiments were conducted to demonstrate the effectiveness of the proposed inexact model, we test the universal fast gradient method to solve some non-smooth problems with a geometrical nature.