Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference72 articles.
1. Atamturk, A., & Gomez, A. (2019). Rank-one convexification for sparse regression. arXiv preprint arXiv:1901.10334
2. Bach, F. (2009). High-dimensional non-linear variable selection through hierarchical kernel learning. arXiv preprint arXiv:0909.0844
3. Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2012). Optimization with sparsity-inducing penalties. Foundations and Trends® in Machine Learning, 4(1), 1–106.
4. Bertsekas, D. P. (1982). Projected newton methods for optimization problems with simple constraints. SIAM Journal on Control and Optimization, 20(2), 221–246.
5. Bertsimas, D., & Copenhaver, M. S. (2018). Characterization of the equivalence of robustification and regularization in linear, median, and matrix regression. European Journal of Operations Research, 270(3), 931–942.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献