A general convexification method via domain transformation scheme is presented for solving a class of global optimization problems with certain monotone properties.It is shown that this class of problems with C^(1,1) ...A general convexification method via domain transformation scheme is presented for solving a class of global optimization problems with certain monotone properties.It is shown that this class of problems with C^(1,1) functions can be converted into equivalent convex optimization problems by using the proposed convexification method.Finally,an example is shown to illustrate how a monotone non-convex optimization problem can be transformed into an equivalent convex minimization problem.展开更多
Based on monotonicity analysis and computer symbolic manipulating technique,a procedure for determining constraints compatibility in design optimization hasbeen proposed in this paper. By using the proposed method rel...Based on monotonicity analysis and computer symbolic manipulating technique,a procedure for determining constraints compatibility in design optimization hasbeen proposed in this paper. By using the proposed method relationshipsbetween constrains can be determined and the optimization is greatly simplifid.The method is code with intelligent production systems.展开更多
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...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.展开更多
基金supported by the Major Program of the National Natural Science Foundation of China(Nos.11991020,11991024)the National Natural Science Foundation of China(No.11871128)+1 种基金Scientific Research Foundation of Chongqing University of Technology(No.2023ZDZ021)Youth project of science and technology research program of Chongqing Education Commission of China(No.KJQN202301160).
文摘A general convexification method via domain transformation scheme is presented for solving a class of global optimization problems with certain monotone properties.It is shown that this class of problems with C^(1,1) functions can be converted into equivalent convex optimization problems by using the proposed convexification method.Finally,an example is shown to illustrate how a monotone non-convex optimization problem can be transformed into an equivalent convex minimization problem.
文摘Based on monotonicity analysis and computer symbolic manipulating technique,a procedure for determining constraints compatibility in design optimization hasbeen proposed in this paper. By using the proposed method relationshipsbetween constrains can be determined and the optimization is greatly simplifid.The method is code with intelligent production systems.
基金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.
