报告题目：A Penalized Sequential Convex Programming Approach for Continuous Network Design Problems
报告人：郭磊，华东理工大学研究员
报告时间：2024年4月22日，下午15：30-17：00
报告地点：红杏自动跳转地址B220
邀请人：孙玉涛 教授
报告摘要：
The continuous network design problem (CNDP) has been recognized as one of the most challenging issues in the field of transportation. Existing approaches to solving CNDP are primarily heuristic or suitable for handling small-scale networks because of the inherent nonconvexity arising from its bilevel hierarchical structure. Efforts to design an efficient and convergent approach for solving CNDP on large-scale networks have been fervently pursued.
In this paper, we present a novel convergent approach centered around unveiling the hidden convexity-like structure within CNDP. We first reveal a difference of convex (DC) structure in the value function-based single-level programming reformulation, i.e., all the functions involved are either convex functions or DC functions. Exploiting the DC-structural property, we give a tight convex programming approximation for CNDP and subsequently propose a penalized sequential convex programming approach. We show that the proposed method can yield an approximately stationary point under some commonly-used conditions. A numerical study is conducted on some real networks from a reputable network repository for transportation research. The numerical results demonstrate the computational superiority of the proposed method as compared to two heuristic approaches and a convergent approach.
报告人简介：
郭磊，华东理工大学研究员。2013年获大连理工大学运筹学与控制论专业博士学位；2013-2015年在上海交通大学做师资博士后研究；2015-2019年任职于上海交通大学，任助理研究员、副研究员；2019年起入职华东理工大学，任特聘研究员。研究兴趣为双层规划的理论与方法及其在交通科学与供应链管理中的应用。截至目前共发表论文近30篇，其中在Mathematical Programming、Mathematics of Operations Research、SIAM系列期刊、Transportation Research Part B等运筹学国际顶级期刊上发表论文11篇。入选国家青年高层次人才计划；获得上海市哲学社会科学优秀成果奖等。主持国家自科基金面上与青年项目3项，省部级基金项目3项；作为骨干成员参与国家自科基金重点项目2项。
上一条：国家社科基金申报若干注意事项
下一条：Optimizing Early Discharge: Trade-offs between Capacity and Readmissions
【关闭】
