Linearly constrained global optimization: a general solution algorithm with applications

2003 ◽  
Vol 134 (2-3) ◽  
pp. 345-361 ◽  
Author(s):  
Hossein Arsham ◽  
Miro Gradisar ◽  
Mojca Indihar Stemberger
2010 ◽  
Vol 2010 ◽  
pp. 1-9 ◽  
Author(s):  
Weixiang Wang ◽  
Youlin Shang ◽  
Ying Zhang

A novel filled function is given in this paper to find a global minima for a nonsmooth constrained optimization problem. First, a modified concept of the filled function for nonsmooth constrained global optimization is introduced, and a filled function, which makes use of the idea of the filled function for unconstrained optimization and penalty function for constrained optimization, is proposed. Then, a solution algorithm based on the proposed filled function is developed. At last, some preliminary numerical results are reported. The results show that the proposed approach is promising.


2011 ◽  
Vol 204-210 ◽  
pp. 114-117
Author(s):  
Wei Xiang Wang ◽  
You Lin Shang ◽  
Lian Sheng Zhang

A generalized filled function method is developed in this paper to solve nonsmooth constrained global optimization problem. Theoretical properties of the proposed function is investigated, and a solution algorithm is proposed. Numerical experiments are also reported in this paper. The preliminary computational results show that the proposed method is promising.


Mathematics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 149
Author(s):  
Yaohui Li ◽  
Jingfang Shen ◽  
Ziliang Cai ◽  
Yizhong Wu ◽  
Shuting Wang

The kriging optimization method that can only obtain one sampling point per cycle has encountered a bottleneck in practical engineering applications. How to find a suitable optimization method to generate multiple sampling points at a time while improving the accuracy of convergence and reducing the number of expensive evaluations has been a wide concern. For this reason, a kriging-assisted multi-objective constrained global optimization (KMCGO) method has been proposed. The sample data obtained from the expensive function evaluation is first used to construct or update the kriging model in each cycle. Then, kriging-based estimated target, RMSE (root mean square error), and feasibility probability are used to form three objectives, which are optimized to generate the Pareto frontier set through multi-objective optimization. Finally, the sample data from the Pareto frontier set is further screened to obtain more promising and valuable sampling points. The test results of five benchmark functions, four design problems, and a fuel economy simulation optimization prove the effectiveness of the proposed algorithm.


Sign in / Sign up

Export Citation Format

Share Document