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

Mathematical Programming, Series B

Volumn 85, Issue 2, 1999, Pages 221-240

  Anstreicher, Kurt M ^a   Fampa, Marcia ^b   Lee, Jon ^c   Williams, Joy ^c  

^a UNIVERSITY OF IOWA   (United States)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c UNIVERSITY OF KENTUCKY   (United States)

Author keywords

Branch and bound; Maximum entropy sampling; Nonlinear programming

Indexed keywords

EID: 0347497595     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050055     Document Type: Article

References (25)

1. Anderson, E., Bai, Z., Bischof, C, Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Ostrouchov, S., Sorensen, D. (1992): LAPACK Users' Guide. SIAM, Philadelphia
2. Anstreicher, K.M., Fampa, M. (1998): A long-step path following algorithm for semidefinite programming problems. In: Pardalos, P.M., Wolkowicz, H., eds., Topics in Semidefinite and Interior-Point Methods, pp. 181-196. The Fields Institute for Research in Mathematical Sciences Communications Series, American Mathematical Society, Providence
3. Anstreicher, K.M., Fampa, M., Lee, J., Williams, J. (1996): Continuous relaxations for constrained maximum-entropy sampling. In: Cunningham, W.H., McCormick, ST., Queyranne, M., eds., Integer Programming and Combinatorial Optimization, 234-248. Lecture Notes in Computer Science 1084. Springer, Berlin
4. Blackwell, D. (1951): Comparison of experiments. In: Proceedings of the 2nd Berkeley Symposium, pp. 93-102. University of California Press, Berkeley
5. Boltzmann, L. (1877): Beziehung zwischen dem zweiten Haupstatz der Wärmetheorie und der Wahrscheinlichkeitsrechnung resp. den Sätzen über das Wärmegleichgewicht (Complexionen-Theorie). Wien Ber. 76, 373
6. Caselton, W.F., Kan, L., Zidek, J.V. (1991): Quality data network designs based on entropy. In: Guttorp, P., Walden, A., eds., Statistics in the Environmental and Earth Science. Griffin, London
7. Caselton, W.F., Zidek, J. (1984): Optimal monitoring network designs, Stat. Prob. Lett. 2, 223-227
8. CPLEX Optimization, Inc. (1994): Using the CPLEX Callable Library
9. Crowder, H., Johnson, E.L., Padberg, M.W. (1983): Solving large-scale zero-one linear programming problems. Oper. Res. 31, 803-834
10. den Hertog, D., Roos, C., Terlaky, T. (1992): On the classical logarithmic barrier method for a class of smooth convex programming problems. JOTA 73, 1-25
11. Fedorov, V., Leonov, S., Antonovsky, M., Pitovranov, S. (1987): The experimental design of an observation network: software and examples. WP-87-05, International Institute for Applied Systems Analysis, Laxenburg, Austria
12. Fedorov, V., Mueller, W. (1989): Comparison of two approaches in the optimal design of an observation network. Statistics 20, 339-351
13. Fiacco, A.V., McCormick, G.P. (1990): Nonlinear Programming, Sequential Unconstrained Minimization Techniques. John Wiley, New York,
14. reprinted as Classics in Applied Mathematics, Vol. 4. SIAM, Philadelphia
15. Freund, R., Roundy, R., Todd, M.J. (1985): Identifying the set of always-active constraints in a system of linear inequalities by a single linear program. Sloan School Working Paper #1674-85, MIT, Cambridge, MA
16. Guttorp, P., Le, N.D., Sampson, P.D., Zidek, J.V. (1992): Using entropy in the redesign of an environmental monitoring network, Technical Report #116. Department of Statistics, The University of British Columbia, Vancouver, British Columbia
17. Horn, R.A., Johnson, C.R. (1985): Matrix Analysis. Cambridge University Press, Cambridge
18. Ko, C.-W., Lee, J., Queyranne, M. (1995): An exact algorithm for maximum entropy sampling. Oper. Res. 43, 684-691
19. Lee, J.: Constrained maximum-entropy sampling. To appear in Oper. Res.
20. Nesterov, Y., Nemirovskii, A. (1994): Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia
21. Pruul, E.A., Nemhauser, G.L., Rushmeier, R.A. (1988): Branch-and-bound and parallel computation: A historical note. Oper. Res. Lett. 7, 65-69
22. Shannon, C.E. (1948): The mathematical theory of communication. Bell System Tech. J. 27, part I, 379-123; part II, 623-656
23. Shewry, M.C., Wynn, H.P., (1987): Maximum entropy sampling. J. Appl. Statistics 46, 165-170
24. Vandenberghe, L., Boyd, S., Xu, S.-P. (1996): Determinant maximization with linear matrix inequality constraints. Technical Report, Information Systems Laboratory, Dept. of Electrical Engineering, Stanford University, Stanford, CA
25. Wu, S., Zidek, J.V. (1992): An entropy based review of selected NADP/NTN network sites for 1983-86. Atmos. Environ. 26A, 2089-2103