Technical Note—An Algorithm for a Class of Discrete Maximum Entropy Problems

DOI10.1287/OPRE.32.1.210MaRDI QIDQ3686519zbMATH OpenOpenAlexFDO

Authors Dwight Freund, Umesh Saxena

Publication date 1984

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.32.1.210

zbMATH Keywords

decision makingbenchmark testingmaximum entropy problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Management decision making, including multiple objectives (90B50) Nonlinear programming (90C30)

Recommendations

• MAXIMUM ENTROPY ALGORITHMS FOR UNCERTAINTY MEASURES
• scientific article; zbMATH DE number 4018254
• scientific article; zbMATH DE number 4136860
• A maximum entropy method for convex programming
• Publication:4887679

Cited in

(4)

• The Maximum Entropy Principle in Decision Making Under Uncertainty: Special Cases Applicable to Developing Technologies
• An entropy estimate for the problem of location of ones in a binary matrix
• An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem
• scientific article; zbMATH DE number 1558098 (Why is no real title available?)

This page was built for publication: Technical Note—An Algorithm for a Class of Discrete Maximum Entropy Problems

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