Maximum likelihood estimates via duality for log-convex models when cell probabilities are subject to convex constraints

DOI10.1214/aos/1024691361zbMath0929.62029MaRDI QIDQ1807148

Hammou El Barmi, Richard L. Dykstra

Publication date: 9 November 1999

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1024691361

zbMATH Keywords

iterative algorithm; duality; maximum likelihood; convex constraints; multinomial; I-projection; convex ones; log-convex constraints

Mathematics Subject Classification ID

62H12: Estimation in multivariate analysis

62F30: Parametric inference under constraints

Related Items

Testing for or against a trend in odds ratios

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An iterative procedure for obtaining I-projections onto the intersection of convex sets
• I-divergence geometry of probability distributions and minimization problems
• Restricted multinomial maximum likelihood estimation based upon Fenchel duality
• Duality of I Projections and Maximum Likelihood Estimation for Log-Linear Models Under Cone Constraints
• Maximum Likelihood Methods for Log-Linear Models When Expected Frequencies are Subjected to Linear Constraints
• Inference for Likelihood Ratio Ordering in the Two-Sample Problem
• Generalized Iterative Scaling for Log-Linear Models