This article is concerned with the computational aspect of l₁ regularization problems with a certain class of piecewise linear loss functions. The problem of computing the l₁ regularization path for a ...

We present a dynamic programming algorithm for solving the single-unit commitment (1UC) problem with ramping constraints and arbitrary convex cost functions. The algorithm is based on a new approach ...