一种求解信赖域子问题的精确解法

An Accurate Method for Solving Trust Region Subproblem

在Hessian矩阵正定的前提下,首先利用线性插值构造了一条折线,并利用该折线提出了一种求解信赖域子问题的精确求解方法,称为分段折线法.并且证明了分段折线路径的合理性,最后分别通过与牛顿法、单折线法、双折线法和切线单折线法的数值实验作比较,数值结果表明新算法是有效且可行的.

According to the basic set of cut sets of connected graphs, a simple and quick method was obtained for the spanning tree containing the specified edges in connected graphs.