Zobrazeno 1 - 5
of 5
pro vyhledávání: '"TIANYUN TANG"'
Publikováno v:
SIAM Journal on Scientific Computing; 2024, Vol. 46 Issue 3, pA2025-A2046, 22p
Autor:
Tianyun Tang, Kim-Chuan Toh
Publikováno v:
Mathematical Programming.
Semidefinite programs are generally challenging to solve due to their high dimensionality. Burer and Monteiro developed a non-convex approach to solve linear SDP problems by applying its low rank property. Their approach is fast because they used fac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81f76074cb84c1ff9c11b747ef386d3b
https://doi.org/10.1007/s10107-023-01952-6
https://doi.org/10.1007/s10107-023-01952-6
Autor:
Tianyun Tang, Kim-Chuan Toh
Publikováno v:
Mathematics of Operations Research.
In this paper, we consider an SDP relaxation of the quadratic knapsack problem (QKP). After using the Burer-Monteiro factorization, we get a non-convex optimization problem, whose feasible region is an algebraic variety. Although there might be non-r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d96ebf225f6f36ad6c3e9f7d427773f9
https://doi.org/10.1287/moor.2022.1345
https://doi.org/10.1287/moor.2022.1345
Autor:
Jie Ma, Tianyun Tang
Akin to the Erd��s-Rademacher problem, Linial and Morgenstern made the following conjecture in tournaments: for any $d\in (0,1]$, among all $n$-vertex tournaments with $d\binom{n}{3}$ many 3-cycles, the number of 4-cycles is asymptotically minimi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92038b93bbeaab63f069d437cb5b3e9f
For integers $n\ge 0$, an iterated triangulation $\mathrm{Tr}(n)$ is defined recursively as follows: $\mathrm{Tr}(0)$ is the plane triangulation on three vertices and, for $n\ge 1$, $\mathrm{Tr}(n)$ is the plane triangulation obtained from the plane
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d96dbf0a78fac7feaf581cada77ac184
http://arxiv.org/abs/1912.00123
http://arxiv.org/abs/1912.00123