[15] Dunlavy, D. M. and O'Leary, D. P. [2005], Homotopy optimization methods for global optimization, Technical report, Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA.
[16] Duong, B. and Nguyen, T. [2022], Bivariate causal discovery via conditional divergence, in 'Conference on Causal Learning and Reasoning'.
[17] Gargiani, M., Zanelli, A., Tran-Dinh, Q., Diehl, M. and Hutter, F. [2020], 'Convergence analysis of homotopy-sgd for non-convex optimization', arXiv preprint arXiv:2011.10298.
[18] Garrigues, P. and Ghaoui, L. [2008], 'An homotopy algorithm for the lasso with online observations', Advances in neural information processing systems 21.
[19] Ge, R., Jin, C. and Zheng, Y. [2017], No spurious local minima in nonconvex low rank problems: A unified geometric analysis, in 'International Conference on Machine Learning', PMLR, pp. 1233-1242.
[20] Ge, R., Lee, J. D. and Ma, T. [2016], 'Matrix completion has no spurious local minimum', Advances in neural information processing systems 29.
[21] Hazan, E., Levy, K. Y. and Shalev-Shwartz, S. [2016], On graduated optimization for stochastic non-convex problems, in 'International conference on machine learning', PMLR, pp. 1833-1841.
[22] Heckerman, D., Geiger, D. and Chickering, D. M. [1995], 'Learning bayesian networks: The combination of knowledge and statistical data', Machine learning 20(3), 197-243.
[23] Iwakiri, H., Wang, Y., Ito, S. and Takeda, A. [2022], 'Single loop gaussian homotopy method for non-convex optimization', arXiv preprint arXiv:2203.05717.
[24] Jaakkola, T., Sontag, D., Globerson, A. and Meila, M. [2010], Learning bayesian network structure using lp relaxations, in 'Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics', Vol. 9 of Proceedings of Machine Learning Research, pp. 358-365.
[25] Jiao, R., Lin, N., Hu, Z., Bennett, D. A., Jin, L. and Xiong, M. [2018], 'Bivariate causal discovery and its applications to gene expression and imaging data analysis', Frontiers Genetics 9, 347.
[26] Kawaguchi, K. [2016], 'Deep learning without poor local minima', Advances in neural information processing systems 29.
[27] Kazemipour, A., Larsen, B. W. and Druckmann, S. [2019], 'Avoiding spurious local minima in deep quadratic networks', arXiv preprint arXiv:2001.00098.
[28] Khalil, H. K. [2002], 'Nonlinear systems third edition', Patience Hall 115.
[29] Lachapelle, S., Brouillard, P., Deleu, T. and Lacoste-Julien, S. [2020], Gradient-based neural dag learning, in 'International Conference on Learning Representations'.
[30] Liang, S., Sun, R., Lee, J. D. and Srikant, R. [2018], 'Adding one neuron can eliminate all bad local minima', Advances in Neural Information Processing Systems 31.
[31] Loh, P.-L. and Buhlmann, P. [2014], 'High-dimensional learning of linear causal networks via inverse covariance estimation', The Journal of Machine Learning Research 15(1), 3065-3105.
[32] Mooij, J. M., Peters, J., Janzing, D., Zscheischler, J. and Scholkopf, B. [2014], 'Distinguishing cause from effect using observational data: methods and benchmarks', Arxiv.
[33] Nesterov, Y. et al. [2018], Lectures on convex optimization, Vol. 137, Springer.
[34] Ng, I., Ghassami, A. and Zhang, K. [2020], On the role of sparsity and dag constraints for learning linear DAGs, in 'Advances in Neural Information Processing Systems'.