On Convexification for a Class of Global Optimization Problems  

作　　者：Qian Yan Xin-Min Yang Zhi-You Wu 

机构地区：[1]College of Mathematics,Sichuan University,Chengdu,610065,Sichuan,China [2]School of Mathematical Science,Chongqing Normal University,Chongqing,401331,China

出　　处：《Journal of the Operations Research Society of China》2022年第3期427-446,共20页中国运筹学会会刊（英文）

基　　金：founded by the National Natural Science Foundation of China(Nos.11991024,11871128,and 11771064).

摘　　要：In this paper,firstly,we give a counterexample to point out there exist deficiencies in our previous works(Wu et al.in J Glob Optim 31:45-60,2005).In addition,we improve the corresponding results.Finally,an example is presented to illustrate how a monotone non-convex optimization problem can be transformed into an equivalent convex minimization problem.

关 键 词：Global optimization DEFICIENCY COUNTEREXAMPLE Monotone optimization Convexification method 

分 类 号：O17[理学—数学]