Maximum likelihood estimates via duality for log-convex models when cell probabilities are subject to convex constraints
From MaRDI portal
Publication:1807148
DOI10.1214/aos/1024691361zbMath0929.62029OpenAlexW2032916603MaRDI 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
iterative algorithmdualitymaximum likelihoodconvex constraintsmultinomialI-projectionconvex oneslog-convex constraints
Related Items
Bayes discriminant rules with ordered predictors, Testing for or against a trend in odds ratios, Nonparametric estimation of convex models via mixtures, Maximum likelihood estimation via duality for cell probabilities subject to convex and log-convex constraints, An alternating iterative method and its application in statistical inference, A cyclic algorithm for maximum likelihood estimation using Schur complement, Profile-Likelihood Inference for Highly Accurate Diagnostic Tests, A note on multinomial maximum likelihood estimation under ordered restrictions and the EM algorithm, The analysis of contingency tables under inequality constraints
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