Hung M. Phan

The rate of linear convergence of the Douglas–Rachford algorithm for subspaces is the cosine of the Friedrichs angle

Heinz H. Bauschke, Yunier Bello-Cruz, T. T. A. Nghia et al. · Journal of Approximation Theory · 2014 · 112 citations

Computing, Computer Science, Mathematics +9

Linear convergence of the Douglas–Rachford method for two closed sets

Hung M. Phan · Optimization · 2015 · 94 citations

Natural Sciences, Mathematics, Computational Geometry +15

Linear and strong convergence of algorithms involving averaged\n nonexpansive operators

Heinz H. Bauschke, Dominikus Noll, Hung M. Phan · arXiv (Cornell University) · 2014 · 92 citations · Full text

Natural Sciences, Computer Science, Mathematics +14

Restricted Normal Cones and the Method of Alternating Projections: Theory

Heinz H. Bauschke, D. Lüke, Hung M. Phan et al. · Set-Valued and Variational Analysis · 2013 · 68 citations · Full text

Computing, Computer Science, Computational Geometry +4

HybridNets: End-to-End Perception Network

Dat Vu, Bao Ngo, Hung M. Phan · arXiv (Cornell University) · 2022 · 68 citations · Full text

Computing, Autonomous Systems, Computer Science +16