首页> 美国政府科技报告 >Simple Unconstrained Dual Convex Programming Method for the Computation of Discrete Maximum Entropy Distributions
【24h】

Simple Unconstrained Dual Convex Programming Method for the Computation of Discrete Maximum Entropy Distributions

机译:离散最大熵分布计算的简单无约束双凸规划法

获取原文

摘要

This document formulates the generalized constrained maximum entropy problem often used in a decision making context as an extended dual convex programming problem. The dual problem is then presented. In this dual setting the primal Lagrange multipliers are precisely the dual variables, and are easily calculated directly by virtue of the simple structure of the dual problem. An example involving the selection of best equipment for an oil spill is presented as an illustration. The authors contrast their solution with those given by previous authors. (Author)

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号