Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"Semidefinite Programming Relaxation"”.
-
Geometric methods in computational optimal transport and high-dimensional inference
… binary spike. Through careful analysis of a semidefinite programming relaxation, it is proved that exact recovery requires a sample size scaling as Θ(plogp/λ2), where p is the dimension and λ the signal strength. Matching lower bounds are established, thereby precisely characterising the …
-
Statistical inference in networks: fundamental limits and efficient algorithms
… model, we derive a computationally efficient semidefinite programming relaxation of the maximum likelihood estimation method and obtain a stronger performance guarantee than previously known. If the community sizes are linear in the total number of vertices, the guarantee matches up to a …
-
New approximation methods for solving binary quadratic programming problem
… we consider a special class of binary quadratic programming problem (BQP) where the number of nonzero elements is fixed. Such problems arise frequently from various applications and have been proved to be NP-hard. After a brief review of the quadratic programming problem, several optimization …