摘要
在凸的可行域上求解非线性优化问题提出了一种新的信赖域方法 ,算法不强调逐次迭代点处目标函数值的严格单调性 对任意初始点 。
This paper presents a new trust-region method for solving nonlinear optimization Problem over convex feasible domains The algorithm don’t enforce strict monotonicity of the objective function values at successive iterates It is proved to be convergent to critical points of the problem from any starting point
出处
《湖北三峡学院学报》
2000年第2期15-19,共5页
Journal of China Three Gorges University(Humanities & Social Sciences)
