Convex relaxation for the generalized maximum-entropy sampling problem

DOI10.1007/S00453-026-01373-9MaRDI QIDQ6851375zbMATH OpenFDO

Authors Gabriel Ponte, Marcia Fampa, Jon Lee

Publication date 27 February 2026

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

principal component analysisD-optimalityconvex relaxationbranch-and-boundmaximum-entropy samplinginteger nonlinear optimization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

This page was built for publication: Convex relaxation for the generalized maximum-entropy sampling problem

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