Constrained Maximum-Entropy Sampling

References

• Anderson E. , Bai Z. , Bischof C. , Demmel J. , Dongarra J. , Du Croz J. , Greenbaum A. , Hammarling S. , Mckenney A. , Ostrouchov S. , Sorensen D. LAPACK Users' Guide (1992) (SIAM) Google Scholar
• Blackwell D. Comparison of experiments. Proc. Second Berkeley Sympos. (1951) University of California Press, Berkeley, CA Google Scholar
• Boltzmann L. Beziehung zwischen dem zweiten haupstatz der wärmetheorie und der wahrscheinlichkeitsrechnung resp. Den Sätzen über Das Wärmegleichgewicht (Complexionen-Theorie). Wien Ber. (1877) 373 . 762 Google Scholar
• Boppana R. B. Eigenvalues and graph bisection: An average case analysis. 28th Annual Sympos. Foundations Computer Science (1987) (IEEE) 280 285 Crossref, Google Scholar
• Caselton W. F. , Kan L. , Zidek J. V. , Guttorp P. , Walden A. Quality data network designs based on entropy. Statistics in the Environmental and Earth Science (1991) (Griffin, London) Google Scholar
• Caselton W. F. , Zidek J. Optimal monitoring network designs. Statist. Probab. Lett. (1984) 2 223 227 Crossref, Google Scholar
• CPLEX Optimization, Inc. Using the CPLEX Callable Library (1994) . Users' Manual for CPLEX 3.0 Google Scholar
• Crowder H. , Johnson E. L. , Padberg M. Solving large-scale zero-one linear programming problems. Opns. Res. (1983) 31 803 834 Link, Google Scholar
• Cullum J. , Donath W. E. , Wolfe P. The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices. Math. Programming Stud. (1976) 3 55 69 Google Scholar
• Delorme C. , Poljak S. Laplacian eigenvalues and the maximum cut problem. Math. Programming (1993) 62 557 574 Crossref, Google Scholar
• Denardo E. Dynamic Programming: Theory and Applications (1982) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Donath W. E. , Hoffman A. J. Lower bounds for the partitioning of graphs. IBM J. Res. and Development (1973) 17 420 425 Crossref, Google Scholar
• Fedorov V. , Leonov S. , Antonovsky M. , Pitovranov S. The experimental design of an observation network: Software and examples. (1987) . Working paper 87-05, International Institute for Applied Systems Analysis, Laxenburg, Austria Google Scholar
• Fedorov V. , Mueller W. Comparison of two approaches in the optimal design of an observation network. Statistics (1989) 20 339 351 Crossref, Google Scholar
• Fisher M. L. The Lagrangian relaxation method for solving integer programming problems. Management Sci. (1981) 27 1 18 Link, Google Scholar
• Garey M. R. , Johnson D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, New York) Google Scholar
• Gollan B. Eigenvalue perturbations and nonlinear parametric optimization. Math. Programming Stud. (1987) 30 67 81 Crossref, Google Scholar
• Guttorp P. , Le N. D. , Sampson P. D. , Zidek J. V. Using entropy in the redesign of an environmental monitoring network. (1992) . Technical report #116, The Department of Statistics, The University of British Columbia Google Scholar
• Horn R. A. , Johnson C. R. Topics in Matrix Analysis (1991) (Cambridge University Press, Cambridge) Crossref, Google Scholar
• Jaynes E. T. , Ford K. W. Information theory and statistical mechanics. Statistical Physics Vol. (1963) (W. A. Benjamin, New York) Google Scholar
• Kato T. Perturbation Theory for Linear Operators (1976) 2nd ed. (Springer, Berlin) Crossref, Google Scholar
• Ko C. W. , Lee J. , Queyranne M. An exact algorithm for maximum entropy sampling. Opns. Res. (1994) 43 684 691 Link, Google Scholar
• Lancaster P. , Tismenetsky M. The Theory of Matrices: With Applications (1985) 2nd ed. (Academic Press, New York) Google Scholar
• Lindley D. On a measure of the information provided by an experiment. Ann. Math. Statist. (1956) 27 986 1005 Crossref, Google Scholar
• Lindley D. Binomial sampling schemes and the concept of information. Biometrika (1957) 44 179 186 Crossref, Google Scholar
• Mohar B. , Poljak S. , Brualdi R. A. , Friedland S. , Klee V. Eigenvalues in combinatorial optimization. Combinatorial and Graph-Theoretical Problems in Linear Algebra (1993) IMA Vol. 50 (Springer-Verlag, New York) Crossref, Google Scholar
• Nemhauser G. L. , Wolsey L. A. Integer and Combinatorial Optimization (1988) (Wiley, New York) Crossref, Google Scholar
• Overton M. L. On minimizing the maximum eigenvalue of a symmetric matrix. SIAM J. Matrix Anal. (1988) 9 256 268 Crossref, Google Scholar
• Overton M. L. , Womersley R. S. Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. Math. Programming (1993) 62 321 357 Crossref, Google Scholar
• Press W. H. , Teukolsky S. A. , Vetterling W. T. , Flannery B. P. Numerical Recipes in FORTRAN: The Art of Scientific Computing (1992) 2nd ed. (Cambridge University Press, Cambridge) Google Scholar
• Rendl F. , Wolkowicz H. A projection technique for partitioning the nodes of graph. (1990) . Technical report, University of Technology, Graz Google Scholar
• Rendl F. , Wolkowicz H. Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. Math. Programming (1992) 53 63 78 Crossref, Google Scholar
• Shannon C. E. The mathematical theory of communication. Bell Systems Tech. J. (1948) 27 379 423 623 656 Crossref, Google Scholar
• Shannon C. E. , Weaver W. The Mathematical Theory of Communication (1949) (The University of Illinois Press, Urbana, IL) Google Scholar
• Shannon C. E. , Weaver W. The Mathematical Theory of Communication (1963) (The University of Illinois Press, Urbana, IL) Google Scholar
• Shewry M. C. , Wynn H. P. Maximum entropy sampling. J. Appl. Statist. (1987) 46 165 170 Crossref, Google Scholar
• Tsing N.-K. , Fan M. K. H. , Verriest E. I. On analyticity of functions involving eigenvalues. Linear Algebra and Its Applications (1994) 207 159 180 Crossref, Google Scholar
• Wu S. , Zidek J. V. An entropy based review of selected NADP/NTN network sites for 1983–86. Atmospheric Environ. (1992) 26A 2089 2103 Crossref, Google Scholar
• Zhu C. , Byrd R. H. , Lu P. , Nocedal J. L-BFGS-B—FORTRAN subroutines for large-scale bound constrained optimization. (1994) (Department of Electrical Engineering, Northwestern University) Google Scholar