Dynamic Regret Bounds without Lipschitz Continuity: Online Convex Optimization with Multiple Mirror Descent Steps | IEEE Conference Publication | IEEE Xplore