The splitting algorithms by Ryu, by Malitsky–Tam, and by Campoy applied to normal cones of linear subspaces converge strongly to the projection onto the intersection HH Bauschke, S Singh, X Wang SIAM Journal on Optimization 33 (2), 739-765, 2023 | 7 | 2023 |
Finding best approximation pairs for two intersections of closed convex sets HH Bauschke, S Singh, X Wang Computational Optimization and Applications 81, 289-308, 2022 | 6 | 2022 |
On Carlier's inequality HH Bauschke, S Singh, X Wang arXiv preprint arXiv:2206.14872, 2022 | 4 | 2022 |
Projecting onto rectangular matrices with prescribed row and column sums HH Bauschke, S Singh, X Wang Fixed Point Theory and Algorithms for Sciences and Engineering 2021, 1-20, 2021 | 4 | 2021 |
Linear-Time Convexity Test for Low-Order Piecewise Polynomials S Singh, Y Lucet SIAM Journal on Optimization 31 (1), 972-990, 2021 | 3 | 2021 |
Uniform simplex of an arbitrary orientation G Jarry-Bolduc, P Nadeau, S Singh Optimization Letters 14 (6), 1407-1417, 2020 | 3 | 2020 |
The splitting algorithms by Ryu and by Malitsky-Tam applied to normal cones of linear subspaces converge strongly to the projection onto the intersection HH Bauschke, S Singh, X Wang arXiv preprint arXiv:2109.11072, 2021 | 2 | 2021 |
On the Bredies-Chenchene-Lorenz-Naldi algorithm HH Bauschke, WM Moursi, S Singh, X Wang arXiv preprint arXiv:2307.09747, 2023 | 1 | 2023 |
Convexity and structure of piecewise polynomial functions on polyhedral domains S Singh University of British Columbia, 2019 | 1 | 2019 |
Strong convergence of recent splitting algorithms and applications of proximal mappings S Singh University of British Columbia, 2024 | | 2024 |