An algorithm for maximizing entropy subject to simple bounds

DOI10.1007/BF01589401zbMATH Open0649.90086OpenAlexW2038078170MaRDI QIDQ1106103FDOQ1106103

Authors: M. J. D. Powell 

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

Recommendations

• An algorithm for maximum entropy image reconstruction from noisy data
• scientific article; zbMATH DE number 4018254
• On Block-Iterative Entropy Maximization
• scientific article; zbMATH DE number 3938413
• Maximum entropy algorithms for image reconstruction from projections

zbMATH Keywords

maximum entropy problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Measures of information, entropy (94A17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• On Thurston’s core entropy algorithm
• Alternating direction method for maximum entropy subject to simple constraint sets.
• Title not available (Why is that?)
• On the convergence of the coordinate descent method for convex differentiable minimization
• Proximal minimization algorithm with \(D\)-functions
• A sequential quadratic programming-based algorithm for the optimization of gas networks
• An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem
• Entropy conservation for comparison-based algorithms
• A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
• Minimal Entropy Approximations and Optimal Algorithms

This page was built for publication: An algorithm for maximizing entropy subject to simple bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106103)