Solving graph equipartition SDPs on an algebraic variety T Tang, KC Toh Mathematical Programming 204 (1), 299-347, 2024 | 8 | 2024 |
Self-adaptive ADMM for semi-strongly convex problems T Tang, KC Toh Mathematical Programming Computation 16 (1), 113-150, 2024 | 6 | 2024 |
A feasible method for general convex low-rank sdp problems T Tang, KC Toh SIAM Journal on Optimization 34 (3), 2169-2200, 2024 | 2 | 2024 |
A feasible method for solving an SDP relaxation of the quadratic knapsack problem T Tang, KC Toh Mathematics of Operations Research 49 (1), 19-39, 2024 | 2 | 2024 |
Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition C Lee, L Liang, T Tang, KC Toh arXiv preprint arXiv:2204.14067, 2022 | 2 | 2022 |
A Riemannian Dimension-Reduced Second-Order Method with Application in Sensor Network Localization T Tang, KC Toh, N Xiao, Y Ye SIAM Journal on Scientific Computing 46 (3), A2025-A2046, 2024 | 1 | 2024 |
Escaping Spurious Local Minima of Low-Rank Matrix Factorization Through Convex Lifting C Lee, L Liang, T Tang, KC Toh CoRR, 2022 | 1 | 2022 |
Minimizing cycles in tournaments and normalized -norms J Ma, T Tang arXiv preprint arXiv:2011.14142, 2020 | | 2020 |
Monochromatic subgraphs in iterated triangulations J Ma, T Tang, X Yu arXiv preprint arXiv:1912.00123, 2019 | | 2019 |