Maximum-entropy remote sampling

DOI10.1016/S0166-218X(00)00217-1zbMath0962.62006MaRDI QIDQ5929307

Joy Williams, Jon Lee, Kurt M. Anstreicher, Márcia H. C. Fampa

Publication date: 19 June 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityNLP relaxationspectral bound

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Complexity and performance of numerical algorithms (65Y20)

Related Items (5)

Generalized maximum-entropy sampling ⋮ Optimal design of experiments for hypothesis testing on ordered treatments via intersection-union tests ⋮ An outer-approximation approach for information-maximizing sensor selection ⋮ Optimal rank-sparsity decomposition ⋮ Mixing convex-optimization bounds for maximum-entropy sampling

Uses Software

• CPLEX
• Unnamed Item

Cites Work

• Unnamed Item
• Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications
• Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
• Constrained Maximum-Entropy Sampling
• Matrix Analysis
• Continuous relaxations for Constrained Maximum-Entropy Sampling
• An Exact Algorithm for Maximum Entropy Sampling

This page was built for publication: Maximum-entropy remote sampling