Author:
Benamou Jean-David,Carlier Guillaume,Nenna Luca
Publisher
Springer International Publishing
Reference39 articles.
1. Bauschke, H.H., Lewis, A.S.: Dykstra’s algorithm with Bregman projections: a convergence proof. Optimization 48 (4), 409–427 (2000)
2. Benamou, J.D., Carlier, G., Cuturi, M., Nenna, L., Peyré, G.: Iterative Bregman projections for regularized transportation problems. arXiv preprint arXiv:1412.5154 (2014)
3. Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics 7 (3), 200–217 (1967)
4. Brenier, Y.: Polar factorization and monotone rearrangement of vector-valued functions. Comm. Pure Appl. Math. 44 (4), 375–417 (1991)
5. Bunge, C.: The full CI density of the Li atom has been computed with a very large basis set with 8 s functions and up to k functions (private communication)
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献