On the computability of continuous maximum entropy distributions with applications
From MaRDI portal
Recommendations
- Entropy, optimization and counting
- An efficient algorithm to compute maximum entropy densities
- Heuristic solutions to polynomial moment problems with some convex entropic objectives
- On maximum entropy and minimum KL-divergence optimization by Gröbner basis methods
- Maximum entropy of nonnegative functions subject to convex constraints
Cites work
- A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary
- A mathematical view of interior-point methods in convex optimization
- Algorithms for convex optimization
- An \(O(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
- An antipodally symmetric distribution on the sphere
- Barrier Functions in Interior Point Methods
- Characterization of the barrier parameter of homogeneous convex cones
- Convex polytopes and quantization of symplectic manifolds
- Differential Operators on a Semisimple Lie Algebra
- Doubly Stochastic Matrices and the Diagonal of a Rotation Matrix
- Entropy, optimization and counting
- scientific article; zbMATH DE number 125586 (Why is no real title available?)
- scientific article; zbMATH DE number 3555239 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 3109251 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Information Theory and Statistical Mechanics
- Lower bounds for norms of products of polynomials via Bombieri inequality
- Maximum entropy density estimation with generalized regularization and an application to species distribution modeling
- On convex perturbations with a bounded isotropic constant
- On the computability of continuous maximum entropy distributions with applications
- On the Self-Concordance of the Universal Barrier Function
- On the variation in the cohomology of the symplectic form of the reduced phase space
- Quantization Bounds on Grassmann Manifolds and Applications to MIMO Communications
- Sampling matrices from Harish-Chandra–Itzykson–Zuber densities with applications to Quantum inference and differential privacy
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- The planar approximation. II
This page was built for publication: On the computability of continuous maximum entropy distributions with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048289)
