One way to find the optimal h is to solve the objectives coordinate-wise-by iterating through w and updating w j via soft-thresholding while keeping w -j fixed. Repeating iterations multiple times, until some predefined stopping criteria, we get the cyclic coordinate descent optimization method, which can be implemented for . Similarly for grouped objectives