摘要
提出了一种易实施的求无约束不可微规划的信赖域算法 。
In this paper, a trust region algorith for unconstrained no ns mooth minimization is given. Under some conditions, we prove that each accumulat ion point of this algorithm is a stationary point of the primitive problem.
出处
《应用数学》
CSCD
北大核心
2001年第3期27-29,共3页
Mathematica Applicata