关键词: 不可微最优化, 函数综合, 极大极小, 连杆机构, 算法

Abstract: By using differential problem to approximate the discrete minimax function synthesis which is a kind of special nondifferentiable optimization problem, a basic algorithm is presented. To overcome some ill- conditioned properties of the approximating problem, a nonmonotone curvilinear search algorithm is given. Using the algorithms above an approach for solving constrained minimax function synthesis is constructed and under weaker conditions the convergence of the approach is obtained. The approach is simpler in form, easily used and has higher accuracy in computation.

Key words: Function synthesis, Minimax Algorithm Linkage, Nondifferential optimization