Generalized scaling for the constrained maximum-entropy sampling problem

DOI10.1007/S10107-024-02101-3MaRDI QIDQ6962862zbMATH OpenFDO

Authors Zhongzhu Chen, Marcia Fampa, Jon Lee

Publication date 8 July 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10107-024-02101-3

zbMATH Keywords

convex optimizationgeneralized scalingmaximum-entropy sampling problemordinary scaling

Mathematics Subject Classification ID

Directional data; spatial statistics (62H11) Design of statistical experiments (62K99) Convex programming (90C25) Combinatorial optimization (90C27) Interior-point methods (90C51)

Cites work

• A Mathematical Theory of Communication
• An Exact Algorithm for Maximum Entropy Sampling
• An R package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data
• Analytic extensions of differentiable functions defined in closed sets.
• Bemerkungen zur Theorie der beschränkten Bilinearformen mit unendlich vielen Veränderlichen.
• 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
• Efficient solution of maximum-entropy sampling problems
• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• Invited Discussion Paper Constrained Optimization of Experimental Design
• 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
• On the (non-)differentiability of the optimal value function when the optimal solution is unique
• Randomized rounding for the largest simplex problem
• Sensitivity and stability analysis for nonlinear programming
• Solving maximum-entropy sampling problems using factored masks
• Technical note -- Masking Anstreicher's Linx bound for improved entropy bounds
• Tridiagonal maximum-entropy sampling and tridiagonal masks
• Tridiagonal maximum-entropy sampling and tridiagonal masks
• Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems

Cited in

(1)

• Convex relaxation for the generalized maximum-entropy sampling problem

This page was built for publication: Generalized scaling for the constrained maximum-entropy sampling problem

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