constrained estimation and the theorem of kuhn-tucker约束估计和kuhn-tucker的定理.pdfVIP

constrained estimation and the theorem of kuhn-tucker约束估计和kuhn-tucker的定理.pdf

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
constrained estimation and the theorem of kuhn-tucker约束估计和kuhn-tucker的定理

CONSTRAINED ESTIMATION AND THE THEOREM OF KUHN-TUCKER ORI DAVIDOV Received 11 July 2004; Accepted 11 January 2005 We explore several important, and well-known, statistical models in which the estimation procedure leads naturally to a constrained optimization problem which is readily solved using the theorem of Kuhn-Tucker. Copyright © 2006 Ori Davidov. This is an open access article distributed under the Cre- ative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 1. Introduction and motivation There are many statistical problems in which the parameter of interest is restricted to a subset of the parameter space. The constraint(s) may reflect prior knowledge about the value of the parameter, or, may be a device used to improve the statistical prop- erties of the estimator. Estimation and inferential procedures for such models may be derived using the theorem of Kuhn-Tucker (KT). The theorem of KT is a theorem in nonlinear programming which extends the method of Lagrange multipliers to inequality constraints. KT theory characterizes the solution(s) to general constrained optimization problems. Often, this characterization yields an algorithmic solution. In general, though, this is not the case and the theorem of KT is used together with other tools or algo- rithms. For example, if the constraints are linear or convex, then the tools of convex optimization (Boyd and Vandenberghe [2]) may be used; of these linear and quadratic programming are best known. More generally, interior point methods, a class of itera- tive methods in which all iterations are guaranteed to stay within the feasible set, may be used. Within this class, Lange [12] describes the adaptive barrier method with statistical applications. Geyer and Thompson [6] develop a Monte-Carlo method for constrained estimation based on a simulation of the likelihood function. Robert

您可能关注的文档

文档评论(0)

xyz118 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档