So at every nonstationary point there exists at least one feasible descent direction, every iterate generated by the methods is feasible so long as the initial iterate is feasible.
这样在每一个非稳定点处至少存在一个可行的下降方向,在初始点是可行点的条件下,此算法产生的每一个迭代点都是可行点。
So at every nonstationary point there exists at least one feasible descent direction, every iterate generated by the methods is feasible so long as the initial iterate is feasible.
这样在每一个非稳定点处至少存在一个可行的下降方向,在初始点是可行点的条件下,此算法产生的每一个迭代点都是可行点。
应用推荐