We discuss the combination of lasso-type, isotonically constrained and trend-filtering penalizations of the least squares estimators on graphs. We show how these estimators are related to each other and propose a computationally feasible numerical solution with a linear complexity per iteration with respect to the amount of edges in the graph.