Lipschitz-Free Mirror Descent Methods for Relatively Strongly Convex Functions with/without Absolute and Relative Inexactness

In this paper, we analyze the mirror descent algorithm for non-smooth optimization problems in which the objective function is relatively strongly convex, without relying on the standard Lipschitz continuity assumption commonly used in the literature. We provide convergence analyses for both exact and inexact subgradient information. Furthermore, through numerical experiments, we compare the derived bounds on the quality of the approximate solutions with existing estimates in the literature and demonstrate the effectiveness of the proposed results.