Maximum likelihood estimates for multinomial probabilities via geometric programming

DOI10.1093/BIOMET/70.1.257MaRDI QIDQ3968302zbMATH OpenOpenAlexFDO

Authors

Publication date 1983

Published in Biometrika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/biomet/70.1.257

zbMATH Keywords

duality theorygeometric programmingmaximum likelihood estimatesmultinomial probabilitiesposynomialsignomial program

Mathematics Subject Classification ID

Parametric inference (62F99) Nonparametric inference (62G99) Applications of statistics to biology and medical sciences; meta analysis (62P10) Nonlinear programming (90C30) Applications of mathematical programming (90C90)

Cited in

(7)

• A tutorial on geometric programming
• MM algorithms for geometric and signomial programming
• Path following in the exact penalty method of convex programming
• A SOLUTION TO GEOMETRIC PROGRAMMING PROBLEMS WITH NEGATIVE DEGREES OF DIFFICULTY
• Estimating cell probabilities in contingency tables with constraints on marginals/conditionals by geometric programming with applications
• Tractable approximate robust geometric programming
• Maximum likelihood estimation of ordered multinomial probabilities by geometric programming

This page was built for publication: Maximum likelihood estimates for multinomial probabilities via geometric programming

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