报告题目:Global optimization methods for two kinds of fractional programming problems
报 告 人: 焦红伟 (河南科技学院 教授)
报告时间:2024年10月12日周六10:00
报告地点:S3-313
Abstract:In this report, we aim to find the global optimal solution of two kinds of fractional programming problems (LFPP), which have numerous applications in many fields of economy and engineering. First of all, by constructing the adaptive branching method and the linear relaxation bounding technique, we propose an adaptive branch-and-bound algorithm to tackle the linear fractional multiplicative problem. Secondly, based on the Charnes-Cooper transformation technique and the outer space branch-and-bound scheme, we propose an outer space algorithm for the sum of linear ratios problem. We prove the global convergence of these algorithms and estimate maximum number of iterations in the worst case. Finally, numerical results verify the efficiency of these two algorithms.
个人简介:
焦红伟,男,博士,教授,数学科学学院副院长,河南省青年骨干教师,河南省教育厅学术技术带头人,河南省优秀硕士学位论文指导教师,中国运筹学会理事,中国运筹学会数学规划分会理事,中国运筹学会算法软件与应用分会理事,河南省运筹学会青年工作委员会主任,河南省运筹学会常务理事。2015年博士研究生毕业于西安电子科技大学。研究方向为:最优化理论、算法及应用。近年来,主持获批国家级、省部级科研项目8项,其中主持获批国家自然科学基金面上项目2项;在European Journal of Operational Research、Journal of Optimization Theory and Applications、Journal of Global Optimization等国内外知名学术期刊上发表论文80余篇,其中被SCI收录60余篇,中科院一区、二区以上20余篇;在科学出版社出版《全局优化问题的分支定界方法》学术专著1部;2023年获河南省自然科学二等奖1项。
上一条:学术报告会:An adaptive cubic regularisation method for nonlinear equality constrained optimization 下一条:学术报告会:Majorized and Generalized ADMM for Convex Composite Programming
【关闭】