Tianyun Tang

13 papers Journal 13
YearRankTypeTitle / Venue / Authors
2026 J jnl
Exploring Chordal Sparsity in Semidefinite Programming with Sparse plus Low-Rank Data Matrices.
SIAM J. Optim.
Tianyun Tang, Kim-Chuan Toh
2025 J jnl
Convex relaxation approaches for high-dimensional optimal transport.
CoRR
Yuehaw Khoo, Tianyun Tang
2025 J jnl
Optimization over convex polyhedra via Hadamard parametrizations.
Math. Program.
Tianyun Tang, Kim-Chuan Toh
2025 J jnl
Stiefel optimization is NP-hard.
CoRR
Zehua Lai, Lek-Heng Lim, Tianyun Tang
2024 J jnl
A Feasible Method for General Convex Low-Rank SDP Problems.
SIAM J. Optim.
Tianyun Tang, Kim-Chuan Toh
2024 J jnl
A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem.
Math. Oper. Res.
Tianyun Tang, Kim-Chuan Toh
2024 J jnl
A Riemannian Dimension-Reduced Second-Order Method with Application in Sensor Network Localization.
SIAM J. Sci. Comput.
Tianyun Tang, Kim-Chuan Toh, Nachuan Xiao, Yinyu Ye
2024 J jnl
Accelerating Nuclear-norm Regularized Low-rank Matrix Optimization Through Burer-Monteiro Decomposition.
J. Mach. Learn. Res.
Ching-pei Lee, Ling Liang, Tianyun Tang, Kim-Chuan Toh
2024 J jnl
Self-adaptive ADMM for semi-strongly convex problems.
Math. Program. Comput.
Tianyun Tang, Kim-Chuan Toh
2024 J jnl
Solving graph equipartition SDPs on an algebraic variety.
Math. Program.
Tianyun Tang, Kim-Chuan Toh
2022 J jnl
Escaping Spurious Local Minima of Low-Rank Matrix Factorization Through Convex Lifting.
CoRR
Ching-pei Lee, Ling Liang, Tianyun Tang, Kim-Chuan Toh
2022 J jnl
Minimizing cycles in tournaments and normalized \(q\)-norms.
Comb. Theory
Jie Ma, Tianyun Tang
2020 J jnl
Monochromatic Subgraphs in Iterated Triangulations.
Electron. J. Comb.
Jie Ma, Tianyun Tang, Xingxing Yu