Journal of the Operations Research Society of China ›› 2022, Vol. 10 ›› Issue (3): 427-446.doi: 10.1007/s40305-021-00379-0

Previous Articles     Next Articles

On Convexification for a Class of Global Optimization Problems

Qian Yan1, Xin-Min Yang2, Zhi-You Wu2   

  1. 1. College of Mathematics, Sichuan University, Chengdu 610065, Sichuan, China;
    2. School of Mathematical Science, Chongqing Normal University, Chongqing 401331, China
  • Received:2021-04-12 Revised:2021-10-25 Online:2022-09-30 Published:2022-09-06
  • Contact: Qian Yan,Xin-Min Yang,Zhi-You Wu E-mail:qianyanmath@163.com;xmyang@cqnu.edu.cn;zywu@cqnu.edu.cnv
  • Supported by:
    The work was founded by the National Natural Science Foundation of China (Nos.11991024,11871128,and 11771064).

Abstract: 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.

Key words: Global optimization, Deficiency, Counterexample, Monotone optimization, Convexification method

CLC Number: