Funder
National Science Foundation
Air Force Office of Scientific Research
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference58 articles.
1. Adler, I., Cottle, R.W., Pang, J.S.: Some LCPs solvable in strongly polynomial time with Lemke’s algorithm. Math. Progr., Ser. A 160(1), 477–493 (2016)
2. Ahn, M., Pang, J.S., Xin, J.: Difference-of-convex learning: directional stationarity, optimality, and sparsity. SIAM J. Optim. 27(3), 1637–1665 (2017)
3. Atamtürk, A., Gómez, A.: Strong formulations for quadratic optimzation with M-matrices and indicator variables. Math. Progr. Seri. B 170, 141–176 (2018)
4. Atamtürk, A., Gómez, A., Han, S.: Sparse and smooth signal estimation: convexification of L0 formulations. J. Mach. Learn. Res. 22, 1–43 (2021)
5. Bach, F.: Submodular functions: from discrete to continuous domains. Math. Program. 175(1), 419–459 (2019)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献