Continuous relaxations for constrained maximum-entropy sampling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1084, Issue , 1996, Pages 234-248

  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

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; COMBINATORIAL OPTIMIZATION; EIGENVALUES AND EIGENFUNCTIONS; ENTROPY;

BRANCH-AND-BOUND ALGORITHMS; CONTINUOUS RELAXATION; EIGEN-VALUE; LINEAR CONSTRAINTS; MAXIMAL DETERMINANTS; MAXIMUM ENTROPY SAMPLING; POSITIVE-DEFINITE MATRICES; TEST PROBLEM;

INTEGER PROGRAMMING;

EID: 0346926490     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_18     Document Type: Conference Paper

References (18)

1. E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Green-Baum, S. Hammarling, A. McKenney, S. Ostrouchov and D. Sorensen (1992), LAPACK Users' Guide. SIAM, Philadelphia.
2. K.M. Anstreicher and M. Fampa (1996), A long-step path following algorithm for semidefinite programming problems. Working paper, Dept, of Management Sciences, University of Iowa, Iowa City.
3. D. Blackwell (1951), Comparison of experiments. In Proceedings of the 2nd Berkeley Symposium, 93-102, University of California Press, Berkeley.
4. L. Boltzmann (1877), Beziehung zwischen dem zweiten Haupstatz der Wãrmetheorie und der Wahrscheinlichkeitsrechnung resp. den Sätzen über das Wãrmegleichgewicht (Complexionen-Theorie). Wien Ber. 762, p. 373.
5. W.F. Caselton, L. Kan and J.V. Zidek (1991), Quality data network designs based on entropy. In Statistics in the Environmental and Earth Science, P. Guttorp and A. Walden, eds., Griffin, London.
6. W.F. Caselton and J. Zidek (1984), Optimal monitoring network designs. Stat. Prob. Lett. 2, 223-227.
7. CPLEX Optimization, Inc. (1994). Using the CPLEX Callable Library.
8. D. den Hertog, C. Roos, and T. Terlaky (1992), On the classical logarithmic barrier method for a class of smooth convex programming problems. JOTA 73, 1-25.
9. V. Fedorov, S. Leonov, M. Antonovsky and S. Pitovranov (1987), The experimental design of an observation network: software and examples. WP-87-05, International Institute for Applied Systems Analysis, Laxenburg, Austria.
10. V. Fedorov and W. Mueller (1989), Comparison of two approaches in the optimal design of an observation network. Statistics 20, 339-351.
11. A.V. Fiacco and G.P. McCormick (1968), Nonlinear Programming, Sequential Unconstrained Minimization Techniques. John Wiley, New York; reprinted as Classics in Applied Mathematics Vol. 4, SIAM, Philadelphia, 1990.
12. P. Guttorp, N.D. Le, P.D. Sampson and J.V. Zidek (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.
13. R, A. Horn and C.R. Johnson (1985), Matrix Analysis. Cambridge University Press, Cambridge.
14. C.-W. Ko, J. Lee, and M. Queyranne (1995), An exact algorithm for maximum entropy sampling. Operations Research 43, 684-691.
15. J. Lee (1995), Constrained maximum-entropy sampling. Working paper, Dept, of Mathematics, University of Kentucky, Lexington, KY.
16. C.E. Shannon (1948), The mathematical theory of communication. Bell Systems Technical Journal 27, 379-423, 623-656.
17. M.C. Shewry and H.P. Wynn (1987), Maximum entropy sampling. Journal of Applied Statistics 46, 165-170.
18. S. Wti and J.V. Zidek (1992), An entropy based review of selected NADP/NTN network sites for 1983-86. Atmospheric Environment 26A, 2089-2103.