Combinatorial optimization with information geometry: the Newton method

DOI10.3390/e16084260zbMath1338.90348OpenAlexW2058157079MaRDI QIDQ296294

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

zbMATH Keywords

combinatorial optimizationNewton methodstatistical manifoldRiemannian Hessian

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Numerical optimization and variational techniques (65K10) Combinatorial optimization (90C27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Local Riemannian geometry (53B20)

Related Items (7)

Natural gradient flow in the mixture geometry of a discrete exponential family ⋮ Black-box optimization using geodesics in statistical manifolds ⋮ Lagrangian and Hamiltonian dynamics for probabilities on the statistical bundle ⋮ Unnamed Item ⋮ Wasserstein Riemannian geometry of Gaussian densities ⋮ Transport information Bregman divergences ⋮ Hessian metric via transport information geometry

Uses Software

• SageMath

Cites Work

• Generalised exponential families and associated entropy functions
• On the Measurement of Polarization

This page was built for publication: Combinatorial optimization with information geometry: the Newton method