1. K.M. Anstreicher, M. Fampa, J. Lee, and J. Williams. Continuous relaxations for constrained maximum-entropy sampling. In Integer programming and combinatorial optimization (Vancouver, BC, 1996), volume 1084 of Lecture Notes in Comp. Sci., pages 234–248. Springer, Berlin, 1996.
2. K.M. Anstreicher, M. Fampa, J. Lee, and J. Williams. Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems. Math. Prog., Ser A, 85(2):221–240, 1999.
3. H.Y. Benson and R.J. Vanderbei. Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming. Math. Prog, Ser. B, 95:279–302, 2003.
4. J.V. Burke, A.S. Lewis, and M.L. Overton. A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. Technical report, October 2003.
5. W.F. Caselton and J.V. Zidek. Optimal monitoring networks. Stat, and Prob. Let., 2:129–178, 1984.