Computational Optimization and Applications Control and Optimization

ADMM for 0/1 D-optimality and maximum-entropy sampling relaxations

Gabriel Ponte, Marcia Fampa, Jon Lee, Luze Xu
Springer Nature · 2026-08-11 · DOI 10.1007/s10589-026-00816-x

Abstract

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.

Read at publisher →