求非线性规划全局最优解的一个算法

A Algorithm for Solving the Global Optimal Solutions of Nonlinear Programming

首先给出了判别f（x）的极小值点x0∈D是否为f（x）的最优解的充分必要条件（D为Rn中的闭区域）；在此基础上，给出了求一元函数及多元函数全局最优解的方法．此外，还给出了求一元函数极值的一个迭代算法．

A necessary and sufficient condition is presented first to decide whether a minimal point x0 of f(x) is a global optimal solution of (x), where D is a closed region in Rn. On the basis of this, an algorithm is given to solve the global optimal solution of (x). In addition, an iterative computing is offered for solving minimal points of singlevariate function.