An Inexact Augmented Lagrangian Method for $(L_0, L_1)$-Smooth Convex Optimization
It is shown that the augmented Lagrangian subproblems preserve the $(L_0,L_1)$-smooth structure, with parameters depending on the penalty coefficient, which allows us to employ recent accelerated first-order schemes designed for generalized smooth optimization instead of classical smooth optimization methods.