Efficient solution of maximum-entropy sampling problems
Year of publication: |
2020
|
---|---|
Authors: | Anstreicher, Kurt M. |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 68.2020, 6, p. 1826-1835
|
Subject: | maximum-entropy sampling | convex programming | nonlinear integer programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Stichprobenerhebung | Sampling |
-
Technical note: masking Anstreicher’s linx bound for improved entropy bounds
Chen, Zhongzhu, (2024)
-
On computing with some convex relaxations for the maximum-entropy sampling problem
Chen, Zhongzhu, (2023)
-
Qin, Ruwen, (2015)
- More ...
-
Interior point methods in mathematical programming
Anstreicher, Kurt M., (1996)
-
Two "well known" properties of subgradient optimization
ANSTREICHER, Kurt M.,
-
Linear programming in $O ({n^3 \over \ln n} L)$ operations
ANSTREICHER, Kurt M.,
- More ...