This chapter rigorously defines and establishes properties of the compression, multinomial lift, kernel, and QPLEX maps, as well as two new maps, the label conditional independence and multinomial projection maps. We use these properties to establish what we call period-by-period optimality of the QPLEX iterates.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Optimality of QPLEX Iterates

  • Antonius B. Dieker,
  • Steven T. Hackman

摘要

This chapter rigorously defines and establishes properties of the compression, multinomial lift, kernel, and QPLEX maps, as well as two new maps, the label conditional independence and multinomial projection maps. We use these properties to establish what we call period-by-period optimality of the QPLEX iterates.