D-optimal Data Fusion : exact and approximation algorithms
| Year of publication: |
2024
|
|---|---|
| Authors: | Li, Yongchun ; Fampa, Marcia Helena Costa ; Lee, Jon ; Qiu, Feng ; Xie, Weijun ; Yao, Rui |
| Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 36.2024, 1, p. 97-120
|
| Subject: | approximation algorithm | D-optimality | data fusion | exact algorithm | Fisher information matrix | maximum-entropy sampling | optimality cut | submodular inequality | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Schätztheorie | Estimation theory | Stichprobenerhebung | Sampling |
-
Probability bounds for polynomial functions in random variables
He, Simai, (2014)
-
Adaptive coordinate sampling for stochastic primal-dual optimization
Liu, Huikang, (2022)
-
Stochastic decomposition for two-stage stochastic linear programs with random cost coefficients
Gangammanavar, Harsha, (2021)
- More ...
-
On computing with some convex relaxations for the maximum-entropy sampling problem
Chen, Zhongzhu, (2023)
-
Technical note: masking Anstreicher’s linx bound for improved entropy bounds
Chen, Zhongzhu, (2024)
-
On computing sparse generalized inverses
Ponte, Gabriel, (2024)
- More ...