Coordinate descent is one of the most familiar approaches to solving the lasso. This five-part series develops an alternative optimization framework based on majorize-minimize algorithms. Starting from the lasso KKT conditions, we derive an equivalent auxiliary problem, a separable MM update, and an adaptive choice of weights for the MM algorithm.