摘要
本文对于无约束问题提出了沿曲线寻优的思想,推导了确定寻优曲线的常微分方程组。对该常微分方程组研制了近似解析和数值的实用算法.借助对偶规划,这一方法由无约束问题推广到约束问题.
An idea of searching along curve lines for the optimum point of an uncon-strained problem is proposed and ordinary differential equations determining search curves are derived in this paper. Both approximately analytical and numerical so-lutions of the ordinary differential equations are developed to be used in practical algorithms . Then our method is extended from unconstrained problems to const-rained ones by means of dual programming.
