COMPUTATIONAL ALGORITHMS BASED ON RANDOM SEARCH FOR SOLVING GLOBAL OPTIMIZATION PROBLEMS

被引:4
作者
MOHAN, C
SHANKER, K
机构
[1] Mathematics Department, University of Roorkee
[2] Computer Center, Central Building Research Institute
关键词
computational methods; Global optimization; random search techniques;
D O I
10.1080/00207169008803842
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Computational algorithms based on random search approach for solving unconstrained and constrained global optimization problems have been proposed and tested on a number of test problems taken from literature. The results show that the proposed algorithms can be used to solve moderately sized unconstrained, inequality constrained and a class of equality constrained global optimization problems. © 1990, Taylor & Francis Group, LLC
引用
收藏
页码:115 / 126
页数:12
相关论文
共 10 条
[1]  
BRACKEN J, 1968, SELECTED APPLICATION
[2]  
Dixon L. C. W., 1978, GLOBAL OPTIMIZATION, V2
[4]  
Himmelblau DM., 2018, APPL NONLINEAR PROGR
[5]  
KAN AHG, 1985, NUMERICAL OPTIMIZATI, P245
[6]   THE TUNNELING ALGORITHM FOR THE GLOBAL MINIMIZATION OF FUNCTIONS [J].
LEVY, AV ;
MONTALVO, A .
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1985, 6 (01) :15-29
[7]  
MOHAN C, INT J COMPUTER MATH, V24
[8]   GLOBAL OPTIMIZATION BY CONTROLLED RANDOM SEARCH [J].
PRICE, WL .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1983, 40 (03) :333-348
[9]  
SCHWEFEL HP, 1980, NUMERICAL OPTIMIZATI
[10]  
[No title captured]