Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems

DOI10.1007/s101070050055zbMath0954.90048OpenAlexW2011141103MaRDI QIDQ1300266

Jon Lee, Kurt M. Anstreicher, Joy Williams, Márcia H. C. Fampa

Publication date: 9 February 2001

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

Full work available at URL: https://doi.org/10.1007/s101070050055

zbMATH Keywords

branch and boundnonlinear programmingmaximum-entropy sampling

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Related Items (13)

Generalized maximum-entropy sampling ⋮ Solving maximum-entropy sampling problems using factored masks ⋮ Tridiagonal maximum-entropy sampling and tridiagonal masks ⋮ An outer-approximation algorithm for maximum-entropy sampling ⋮ An outer-approximation algorithm for maximum-entropy sampling ⋮ An outer-approximation approach for information-maximizing sensor selection ⋮ A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs ⋮ An R package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data ⋮ Efficient Solution of Maximum-Entropy Sampling Problems ⋮ Maximum-entropy sampling and the Boolean quadric polytope ⋮ Maximum-entropy remote sampling ⋮ Mixing convex-optimization bounds for maximum-entropy sampling ⋮ Approximately optimal subset selection for statistical design and modelling

Uses Software

• LAPACK

This page was built for publication: Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems