Tridiagonal maximum-entropy sampling and tridiagonal masks
From MaRDI portal
Publication:6162032
DOI10.1016/j.dam.2023.04.020zbMath1519.90198arXiv2112.12814OpenAlexW4376119957MaRDI QIDQ6162032
Publication date: 15 June 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.12814
spiderdynamic programminglocal searchcovariance matrixcorrelation matrixdifferential entropytridiagonalmasknonlinear combinatorial optimizationmaximum-entropy samplingarrowhead
Cites Work
- Unnamed Item
- Unnamed Item
- Some comments on \(k\)-tridiagonal matrices: determinant, spectra, and inversion
- Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
- Solving maximum-entropy sampling problems using factored masks
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
- A linear integer programming bound for maximum-entropy sampling
- Second-order cone programming
- Maximum-entropy sampling and the Boolean quadric polytope
- Mixing convex-optimization bounds for maximum-entropy sampling
- An R package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data
- On distinguishing trees by their chromatic symmetric functions
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- Randomized Rounding for the Largest Simplex Problem
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Continuous relaxations for Constrained Maximum-Entropy Sampling
- An Exact Algorithm for Maximum Entropy Sampling
- Efficient Solution of Maximum-Entropy Sampling Problems
