| 极大熵方法与二次规划子问题的显式解 |
| |
| 引用本文： | 岑利群,施保昌. 极大熵方法与二次规划子问题的显式解[J]. 应用数学, 2000, 13(2): 123-127 |
| |
| 作者姓名： | 岑利群 施保昌 |
| |
| 作者单位： | 华中理工大学数学系,湖北,武汉,430074 |
| |
| 摘 要： | 本文对混合约束极大极小问题的目标函数与约束分别用熵函数来逼近，讨论了逼近问题的二次规划子问题的搜索方向的显式形式，并给出了极大极小问题和多目标规划的二次规划予问题的显式解。将所得结果用于相应的算法中，可提高算法的有效性。
|
| 关 键 词： | 极大极小问题 极大熵方法 二次规划 显式解 |
| 修稿时间： | 1999-11-29 |
Maximum Entropy Method and Quadratic Programming SUB-problem's Explicit Solution |
| |
| CEN Li-qun,SHI Bao-chang. Maximum Entropy Method and Quadratic Programming SUB-problem's Explicit Solution[J]. Mathematica Applicata, 2000, 13(2): 123-127 |
| |
| Authors: | CEN Li-qun SHI Bao-chang |
| |
| Abstract: | In this paper, the objective function and theconstraints of the constrained minimax problem are approximated by the entropy functions.The explicit search directions of the Quadratic Programming (QP) sub-problems of theapproximating problem are discussed, and the explicit solutions of the QP sub-problems ofthe minimax problem and the multi-objective problems are obtained.The results can beapplied to corresponding algorithms to improve their efficiency. |
| |
| Keywords: | Minimax problem Maximum entropy method Quadratic Programming Kuhn-Tucker condition Explicit search direction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
