含脊优化问题的变换坐标改进优化算法
首发时间:2007-11-13
摘要:采用加固围墙的内点惩罚函数法和传统的外点惩罚函数法,研究了约束优化问题的求解。针对惩罚函数法的序列无约束优化问题含有脊的特点,提出了基于坐标变换的无约束优化改进算法,适合于坐标轮换法、模式搜索法、Powell法等无须计算梯度值的方法。对含等式约束和不等式约束的优化问题进行了计算。计算结果表明(1)如采用变换坐标改进优化算法则可寻得含脊优化问题的真最优点,否则易寻得伪最优点;(2)一维盲人探路优化方法是一种有效的一维寻优方法;(3)加固围墙的内点惩罚函数法对初始点没有特殊要求,比传统的内点惩罚函数法具有更广的适用范围。
关键词: 机械优化设计 加固围墙的内点惩罚函数法 脊 坐标变换 教学
For information in English, please click here
Changing coordinate optimal improved arithmetic for the optimal problem with ridge
Abstract:The constraint optimal problem is studied by the reinforced wall internal and ordinary exterior penalty function method. For the serial unconstraint optimal problem with ridge, the improved arithmetic for unconstraint optimal problem based on the changing coordinate is improved. It is fit for the optimal method needing not to calculate grads, such as coordinate switchover, pattern optimization, or Powell method. The computing calculation of example optimal problems with equality and inequality constraint are done. The computing results show that (1)if used the changing coordinate improved arithmetic, the real optimal point is found, otherwise the false point is found; (2)the one-dimension blind-walking optimization method is valid; (3)the reinforced wall internal penalty method has no special requirement for the initial point, so it has more applicability than the ordinary method.
Keywords: Mechanism Optimization Design reinforced wall internal penalty function method ridge the changing coordinate improved arithmetic teaching
论文图表:
引用
No.1631210486211949****
同行评议
共计0人参与
勘误表
含脊优化问题的变换坐标改进优化算法
评论
全部评论0/1000