{"title":"An MM Algorithm for Estimating the MNL Model with Product Features","authors":"Srikanth Jagabathula, Ashwin Venkataraman","doi":"10.2139/ssrn.3733971","DOIUrl":null,"url":null,"abstract":"The multinomial logit (MNL) model is a workhorse model for modeling customer demand in many fields including operations, econometrics and marketing. In this work, we present a fast algorithm for solving the likelihood maximization problem for the MNL model with product features. Our algorithm falls under the general framework of minorize-maximize (MM) procedures and we show that it results in an efficient iterative procedure with closed-form updates. We establish a necessary and sufficient condition under which the optimization problem has a unique and bounded solution and establish convergence of our proposed algorithm to the global optimal solution.","PeriodicalId":236552,"journal":{"name":"DecisionSciRN: Other Decision-Making in Operations Research (Topic)","volume":"392 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"DecisionSciRN: Other Decision-Making in Operations Research (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3733971","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The multinomial logit (MNL) model is a workhorse model for modeling customer demand in many fields including operations, econometrics and marketing. In this work, we present a fast algorithm for solving the likelihood maximization problem for the MNL model with product features. Our algorithm falls under the general framework of minorize-maximize (MM) procedures and we show that it results in an efficient iterative procedure with closed-form updates. We establish a necessary and sufficient condition under which the optimization problem has a unique and bounded solution and establish convergence of our proposed algorithm to the global optimal solution.