We propose the algorithms for online convex optimization which lead to cumulative squared constraint violations of the form β ∈ (0, 1) . Previous literature has focused on long-term constraints of the form g(x t ). There, strictly feasible solutions can cancel out the effects of violated constraints. In contrast, the new form heavily penalizes large constraint violations and cancellation effects cannot occur. Furthermore, useful bounds on the single step constraint violation [g(x t )] + are derived. For convex objectives, our regret bounds generalize existing bounds, and for strongly convex objectives we give improved regret bounds. In numerical experiments, we show that our algorithm closely follows the constraint boundary leading to low cumulative violation.
The new constraint residual form considered in REF heavily penalizes large constraint violations and strictly feasible solutions of some rounds cannot cancel out the effect of violated constraints at other rounds.
Online convex optimization for cumulative constraints
ArXiv
ArXiv
Computer Science Mathematics