activity
20162022
most citedSemidefinite Programming Approach for the Quadratic Assignment Problem with a Sparse Graph

3 citations · 8 across the 6 of their papers we have counts for

collaborators
Showing math.OCShow all

5 papers · 1 filter

math.OC2021

Scalable semidefinite programming approach to variational embedding for quantum many-body problems

Yuehaw Khoo, Michael Lindsey

In quantum embedding theories, a quantum many-body system is divided into localized clusters of sites which are treated with an accurate `high-level' theory and glued together self…

math.OC2020

Maximizing robustness of point-set registration by leveraging non-convexity

Cindy Orozco Bohorquez, Yuehaw Khoo, Lexing Ying

Point-set registration is a classical image processing problem that looks for the optimal transformation between two sets of points. In this work, we analyze the impact of outliers…

math.OC2019

Semidefinite relaxation of multi-marginal optimal transport for strictly correlated electrons in second quantization

Yuehaw Khoo, Lin Lin, Michael Lindsey +1

We consider the strictly correlated electron (SCE) limit of the fermionic quantum many-body problem in the second-quantized formalism. This limit gives rise to a multi-marginal opt…

math.OC2018

Convex relaxation approaches for strictly correlated density functional theory

Yuehaw Khoo, Lexing Ying

In this paper, we introduce methods from convex optimization to solve the multimarginal transport type problems arise in the context of density functional theory. Convex relaxation…

math.OC20173 cited

Semidefinite Programming Approach for the Quadratic Assignment Problem with a Sparse Graph

Jose F. S. Bravo Ferreira, Yuehaw Khoo, Amit Singer

The matching problem between two adjacency matrices can be formulated as the NP-hard quadratic assignment problem (QAP). Previous work on semidefinite programming (SDP) relaxations…