  We propose two Polyak-type step sizes for mirror descent and prove their
convergences for minimizing convex locally Lipschitz functions. Both step
sizes, unlike the original Polyak step size, do not need the optimal value of
the objective function.
