| 凸规划内点算法在连杆机构优化设计中的应用 |
| |
| 引用本文： | 张雄,周济,蒙远红.凸规划内点算法在连杆机构优化设计中的应用[J].华中科技大学学报(自然科学版),1996(7). |
| |
| 作者姓名： | 张雄 周济 蒙远红 |
| |
| 作者单位： | 华中理工大学机械科学与工程学院 |
| |
| 摘 要： | 提出一种非线性原－对偶内点凸规划算法，并用这种优化方法解决机构优化设计问题．该算法已编写成计算机程序，并在ＩＢＭＰＣ／ＡＴ－４８６计算机上考核通过．数值实验结果和实际机构优化设计应用均显示，该算法具有所得到的解可靠（对于凸规划问题，解都是内点）、迭代次数和函数调用次数都比较少等优点．
|
| 关 键 词： | 机构优化 原－对偶算法 内点法 凸规划 优化设计 |
The Application of an Interior Point Method in Convex Programming to Optimal Design of Mechanical Linkage |
| |
| Zhang Xiong, Zhou Ji, Meng Yunhong.The Application of an Interior Point Method in Convex Programming to Optimal Design of Mechanical Linkage[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,1996(7). |
| |
| Authors: | Zhang Xiong Zhou Ji Meng Yunhong |
| |
| Abstract: | primal-dual interior point algorithm for linearly constrained convex nonlinear programming is presented and has been used to deal with the optimal design of mechanical linkage. The algorithm has been implemented and tested on an IBM PC/AT-486 computer. The results of numerical experimentation and practical application in optimal linkage design demonstrate that the solution obtained with the algorithm proposed is reliable, as teh solution of any convex programming is always an interior point. There are also the merits of fewer iterations and less call numbers of function. |
| |
| Keywords: | mechanism optimization primal-dual method interior point approach convex programming optimal design |
| 本文献已被 CNKI 等数据库收录！ |
