1. Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J., et al. (2011). Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1), 1–122.
2. Bregman, L. M. (1966). A relaxation method of finding a common point of convex sets and its application to problems of optimization’. In Soviet Mathematics Doklady, 7, 1578–1581.
3. Breiman, L. (1991). The ii method for estimating multivariate functions from noisy data. Technometrics, 33(2), 125–143.
4. Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984). Classification and Regression Trees. Belmont, CA: Wadsworth.
5. Bunea, F., Tsybakov, A., Wegkamp, M., et al. (2007). Sparsity oracle inequalities for the lasso. Electronic Journal of Statistics, 1, 169–194.