11 citations · 21 across the 19 of their papers we have counts for
Showing 2021 · math.OCShow all
2 papers · 2 filters
math.OC2021
On computing with some convex relaxations for the maximum-entropy sampling problem
Zhongzhu Chen, Marcia Fampa, Jon Lee
Based on a factorization of an input covariance matrix, we define a mild generalization of an upper bound of Nikolov (2015) and Li and Xie (2020) for the NP-Hard constrained maximu…
math.OC2021
Tridiagonal Maximum-Entropy Sampling and Tridiagonal Masks
Hessa Al-Thani, Jon Lee
The NP-hard maximum-entropy sampling problem (MESP) seeks a maximum (log-)determinant principal submatrix, of a given order, from an input covariance matrix . We give an efficie…