Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees

DOI10.1287/OPRE.2023.2488MaRDI QIDQ6579643zbMATH OpenFDO

Authors Weijun Xie

Publication date 25 July 2024

Published in Operations Research (Search for Journal in Brave)

zbMATH Keywords

local search algorithmA-optimalitysampling algorithmmachine learning and data scienceconvex integer programmaximum entropy sampling problem

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10)

Recommendations

• Efficient solution of maximum-entropy sampling problems
• An Exact Algorithm for Maximum Entropy Sampling
• Tridiagonal maximum-entropy sampling and tridiagonal masks
• Mixing convex-optimization bounds for maximum-entropy sampling
• Continuous relaxations for Constrained Maximum-Entropy Sampling

Cited in

(1)

• Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023

This page was built for publication: Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579643)