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

Full work available at URL https://doi.org/10.1007/S00453-026-01373-9

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)

Cites work

• scientific article; zbMATH DE number 806801 (Why is no real title available?)
• A Mathematical Theory of Communication
• A Theoretical and Experimental Study of the Symmetric Rank-One Update
• A linear integer programming bound for maximum-entropy sampling
• Algorithm 778: L-BFGS-B
• An Exact Algorithm for Maximum Entropy Sampling
• An overview of MINLP algorithms and their implementation in Muriqui optimizer
• BARON: A general purpose global optimization software package
• Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees
• Constrained maximum-entropy sampling
• Continuous relaxations for Constrained Maximum-Entropy Sampling
• D-Optimal Data Fusion: Exact and Approximation Algorithms
• Efficient solution of maximum-entropy sampling problems
• Generalized maximum-entropy sampling
• Generalized scaling for the constrained maximum-entropy sampling problem
• Juniper: an open-source nonlinear branch-and-bound solver in Julia
• Largest \(j\)-simplices in \(n\)-polytopes
• Maximum-entropy sampling and the Boolean quadric polytope
• Mixing convex-optimization bounds for maximum-entropy sampling
• Nonsmooth optimization via quasi-Newton methods
• On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem
• Principal component analysis: a review and recent developments
• Randomized rounding for the largest simplex problem
• Solving maximum-entropy sampling problems using factored masks
• Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems

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)