




















Abstract:The 0/1 D-optimality problem and the Maximum-Entropy Sampling problem are two well-known NP-hard discrete maximization problems in experimental design. Algorithms for exact optimization (of moderate-sized instances) are based on branch-and-bound. The best upper-bounding methods are based on convex relaxation. We present ADMM (Alternating Direction Method of Multipliers) algorithms for solving these relaxations and experimentally demonstrate their practical value.
From: Jon Lee [view email]
[v1]
Tue, 5 Nov 2024 19:24:30 UTC (144 KB)
[v2]
Tue, 25 Mar 2025 15:14:45 UTC (461 KB)
[v3]
Tue, 16 Jun 2026 14:59:25 UTC (515 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。