Efficient Solution of Maximum-Entropy Sampling Problems
暂无分享,去创建一个
[1] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[2] Alexander Graham,et al. Kronecker Products and Matrix Calculus: With Applications , 1981 .
[3] Kurt M. Anstreicher,et al. Maximum-entropy sampling and the Boolean quadric polytope , 2018, J. Glob. Optim..
[4] Jon Lee,et al. Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems , 1999, Math. Program..
[5] Jon Lee. Constrained Maximum-Entropy Sampling , 1998, Oper. Res..
[6] Maurice Queyranne,et al. An Exact Algorithm for Maximum Entropy Sampling , 1995, Oper. Res..
[7] Jon Lee,et al. A linear integer programming bound for maximum-entropy sampling , 2003, Math. Program..
[8] Kim-Chuan Toh,et al. On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 , 2012 .
[9] K. Anstreicher,et al. A Masked Spectral Bound for Maximum-Entropy Sampling , 2004 .
[10] Stephen P. Boyd,et al. Determinant Maximization with Linear Matrix Inequality Constraints , 1998, SIAM J. Matrix Anal. Appl..
[11] W. Marsden. I and J , 2012 .
[12] Jon Lee,et al. Continuous Relaxations for Constrained Maximum-Entropy Sampling , 1996, IPCO.
[13] Jon Lee,et al. Solving maximum-entropy sampling problems using factored masks , 2007, Math. Program..
[14] Jon Lee,et al. New upper bounds for maximum-entropy sampling , 2000 .
[15] Jon Lee. Maximum entropy sampling , 2001 .