An algorithm for maximizing entropy subject to simple bounds
From MaRDI portal
Publication:1106103
DOI10.1007/BF01589401zbMath0649.90086OpenAlexW2038078170MaRDI QIDQ1106103
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01589401
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Measures of information, entropy (94A17)
Related Items (6)
An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem ⋮ A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier ⋮ Alternating direction method for maximum entropy subject to simple constraint sets. ⋮ A sequential quadratic programming-based algorithm for the optimization of gas networks ⋮ On the convergence of the coordinate descent method for convex differentiable minimization ⋮ Proximal minimization algorithm with \(D\)-functions
Cites Work
This page was built for publication: An algorithm for maximizing entropy subject to simple bounds
