约束复合形法在非凸可行域上的一种修正算法  

A Method of Modifier Algorithm of Constrained Complex Method in Concave Feasible Fields

作　　者：裴锦华[1] 孙思诚[2] 

机构地区：[1]南京航空航天大学无人机研究所,南京210016 [2]南京理工大学机械学院,南京210094

出　　处：《南京理工大学学报》2000年第1期16-19,共4页Journal of Nanjing University of Science and Technology

摘　　要：约束复合形法是求解约束非线性最优问题的一种重要方法。该文对约束复合形法在非凸可行域上的迭代计算方法进行了探讨 ,针对复合形形心点落于可行域之外的情况 ,对常规的复合形算法进行了修正 ,提出了一种适合于工程计算的、高效实用的迭代算法。通过一个工程优化问题的对比计算 ,验证了这种迭代计算方法的收敛性以及工程适用性。The constrained complex method is one of the important ways to resolve the problem of nonlinear optimization.The iterative calculating method of constrained complex method in concave feasible fields is discussed in this paper. In view of the situation that the central point of complex is out of the feasible fields, the common complex algorithm is modified and a new method of iterative calculation is provided for engineering calculation. At the same time, through the contrasting calculation of an engineering optimization problem, the astringency and engineering usability of this modifier algorithm are proved.The computation results show that the method of modifier algorithm of constrained complex method in concave feasible fields,proposed in this paper, is effective.

关 键 词：非凸可行域 约束复合形法 修正算法 最优化 

分 类 号：O224[理学—运筹学与控制论]