AN APPROACH TO SOLVE LOCAL AND GLOBAL OPTIMIZATION PROBLEMS BASED ON EXACT OBJECTIVE FILLED PENALTY FUNCTIONS

被引:1
作者
Tang, Jiahui [1 ]
Xu, Yifan [1 ]
Wang, Wei [2 ]
机构
[1] Fudan Univ, Sch Management, Shanghai 200433, Peoples R China
[2] East China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China
基金
中国国家自然科学基金;
关键词
Constrained optimization problems; globally optimal points; locally optimal points; objective filled penalty functions; exactness and filling properties;
D O I
10.3934/jimo.2022084
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this work, an exact objective penalty function and an exact objective filled penalty function are proposed to solve constrained optimization problems. There are two main innovations of these two functions: using the exact objective penalty function to find a locally optimal point; a better locally optimal point than the current one can be found by exact objective filled penalty function. A local search method and a global search method for constrained optimization problems are proposed. We can use this new global search method to compute an approximately globally optimal point for constrained optimization problems. The convergence of the sequences obtained by the new algorithms are also analyzed respectively. Finally, the rationality of these two search methods are illustrated by numerical experiments.
引用
收藏
页码:3217 / 3229
页数:13
相关论文
共 25 条