Combinatorial optimization with information geometry: the Newton method
DOI10.3390/E16084260zbMATH Open1338.90348OpenAlexW2058157079MaRDI QIDQ296294FDOQ296294
Giovanni Pistone, Luigi Malagò
Publication date: 15 June 2016
Published in: Entropy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/e16084260
Numerical optimization and variational techniques (65K10) Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Local Riemannian geometry (53B20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
Cited In (9)
- Wasserstein Riemannian geometry of Gaussian densities
- Natural gradient flow in the mixture geometry of a discrete exponential family
- Black-box optimization using geodesics in statistical manifolds
- Optimization via Information Geometry
- Lagrangian and Hamiltonian dynamics for probabilities on the statistical bundle
- Title not available (Why is that?)
- Newton polytopes and relative entropy optimization
- Transport information Bregman divergences
- Hessian metric via transport information geometry
Uses Software
Recommendations
- Optimization via Information Geometry 👍 👎
- Information Theoretic Approach to Geometric Programming 👍 👎
- Information-Geometric Optimization Algorithms: A Unifying Picture via Invariance Principles 👍 👎
- Information Geometry and Interior-Point Algorithms 👍 👎
- Information geometry applications for optimizing numerical simulations 👍 👎
- Newton polytopes and relative entropy optimization 👍 👎
- The Newton sums method in combinatorial optimization 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Combinatorial optimization with information geometry: the Newton method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296294)
