Combinatorial optimization with information geometry: the Newton method
From MaRDI portal
(Redirected from Publication:296294)
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
- scientific article; zbMATH DE number 3872359
Cites work
Cited in
(10)- Optimization via Information Geometry
- Second-order optimization over the multivariate Gaussian distribution
- Differential analytic aspects of statistical models
- Wasserstein Riemannian geometry of Gaussian densities
- Hessian metric via transport information geometry
- Transport information Bregman divergences
- Newton polytopes and relative entropy optimization
- 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
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)