J. Giesen, M. Jaggi, and S. Laue. Approximating parameterized convex optimization problems. In European Symposium on Algorithms, pages 524-535. Springer, 2010.
J. Giesen, J. Müller, S. Laue, and S. Swiercy. Approximating concavely parameterized optimization problems. In Advances in neural information processing systems, pages 2105-2113, 2012.
J. Giesen, S. Laue, and P. Wieschollek. Robust and efficient kernel hyperparameter paths with guarantees. In International Conference on Machine Learning, pages 1296-1304, 2014.
M. Grant and S. Boyd. Cvx: Matlab software for disciplined convex programming, version 2.1, 2014.
M. C. Grant and S. P. Boyd. Graph implementations for nonsmooth convex programs. In *Recent advances in learning and control*, pages 95-110. Springer, 2008.
T. Hastie, S. Rosset, R. Tishirani, and J. Zhu. The entire regularization path for the support vector machine. Journal of Machine Learning Research, 5:1391 - 1415, 2004.
T. Hastie, J. Taylor, R. Tibshirani, G. Walther, et al. Forward stagewise regression and the monotone lasso. Electronic Journal of Statistics, 1:1-29, 2007.
H. Hoefling. A path algorithm for the fused lasso signal approximator. Journal of Computational and Graphical Statistics, 19(4):984-1006, 2010. doi: 10.1198/jcgs.2010.09208.
H. Karimi, J. Nutini, and M. Schmidt. Linear convergence of gradient and proximal-gradient methods under the polyak-lojasiewicz condition. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pages 795-811. Springer, 2016.
E. Ndiaye. Safe optimization algorithms for variable selection and hyperparameter tuning. PhD thesis, Université Paris-Saclay (ComUE), 2018.
E. Ndiaye, T. Le, O. Fercoq, J. Salmon, and I. Takeuchi. Safe grid search with optimal complexity. In International Conference on Machine Learning, pages 4771-4780, 2019.
Y. E. Nesterov and A. S. Nemirovskii. Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms. SIAM Publications, 1993.
M. Osborne. An effective method for computing regression quantiles. IMA Journal of Numerical Analysis, 12: 151-166, 1992.
M. Osborne, B. Presnell, and B. Turlach. A new approach to variable selection in least squares problems. IMA Journal of Numerical Analysis, 20(3):389 - 403, 2000.
B. T. Polyak. Gradient methods for solving equations and inequalities. USSR Computational Mathematics and Mathematical Physics, 4(6):17-32, 1964.
X. Qu, D. Li, X. Zhao, and B. Gu. Gaga: Deciphering age-path of generalized self-paced regularizer. Advances in Neural Information Processing Systems, 35:32025-32038, 2022.
S. Rosset. Following curved regularized optimization solution paths. In Advances in Neural Information Processing Systems, 2004.
S. Rosset and J. Zhu. Piecewise linear regularized solution paths. Ann. Statist., 35(3):1012-1030, 2007. doi: 10.1214/009053606000001370.
T. Sun and Q. Tran-Dinh. Generalized self-concordant functions: a recipe for newton-type methods. Mathematical Programming, pages 1-69, 2017.
R. J. Tibshirani and J. Taylor. The solution path of the generalized lasso. The Annals of Statistics, pages 1335-1371, 2011.
Y. Zhu and R. Liu. An algorithmic view of  $\ell_2$ -regularization and some path-following algorithms. The Journal of Machine Learning Research, 22(1):6123-6184, 2021.