| 广义几何规划的加速全局优化算法 |
| |
| 引用本文： | 王开荣,马琳.广义几何规划的加速全局优化算法[J].山东大学学报(理学版),2013,48(1):72-77. |
| |
| 作者姓名： | 王开荣 马琳 |
| |
| 作者单位： | 重庆大学数学与统计学院,重庆,401331 |
| |
| 基金项目： | 重庆市高等教育教学改革研究重点项目(102104) |
| |
| 摘 要： | 广义几何规划(generalized geometric programming,GGP)问题广泛出现在工程设计、风险管理以及工业制造等实际应用中。基于凸松弛提出GGP的加速全局优化算法,该算法通过新的剪枝技术,能将当前计算的不存在全局最优解的区域去除,从而加速算法收敛到全局最优解。最后给出了算法的收敛性证明。数值实验表明该算法是可行有效的。
|
| 关 键 词： | 广义几何规划 全局优化 凸松弛 剪枝技术 |
| 收稿时间： | 2012-03-16 |
An accelerating algorithm for solving global solution of generalized geometric programming |
| |
| WANG Kai-rong,MA Lin.An accelerating algorithm for solving global solution of generalized geometric programming[J].Journal of Shandong University,2013,48(1):72-77. |
| |
| Authors: | WANG Kai-rong MA Lin |
| |
| Institution: | (College of Mathematics and Statistics,Chongqing University,Chongqing 401331,China) |
| |
| Abstract: | Generalized Geometric Programming(GGP) problems widely occur in engineering design, risk management, manufacturing, and so on. Based on the convex relaxation, an accelerating algorithm for solving global solution of generalized geometric programming was proposed. A new pruning technique was used to cut away the current investigated region in which the global optimal solution does not exist and improve the convergence speed of this algorithm. Convergence of the algorithm was proved. Some experiments are reported to show the feasibility and efficiency of the proposed algorithm. |
| |
| Keywords: | generalized geometric programming global optimization convex relaxation pruning technique |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《山东大学学报(理学版)》下载免费的PDF全文 |
|
