Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach (Q1380525): Difference between revisions

Summary: The problem of assigning cell probabilities to minimize a multinomial likelihood with order restrictions on the probabilities and/or restrictions on the local odds ratios is modeled as a posynomial geometric program (GP), a class of nonlinear optimization problems with a well-developed duality theory and collection of algorithms. (Local odds ratios provide a measure of association between categorical random variables.) A constrained multinomial MLE example from the literature is solved, and the quality of the solution is compared with that obtained by the iterative method of \textit{H. El Barmi} and \textit{R.L. Dykstra} [Tech. Rep. No. 265, Univ. Iowa, Dpt. Stat. Actuarial Sci. (1997)] which is based upon Fenchel duality. Exploiting the proximity of the GP model of MLE problems to linear programming (LP) problems, we also describe as an alternative, in the absence of special-purpose GP software, an easily implemented successive LP approximation method for solving this class of MLE problems using one of the readily available LP solvers.