It takes line search instead of resolving the subproblem to get the new trial step and the next iteration point when the trial step is not successful.It allows a considerable computational saving.

• 当试探步不成功时，并不重解子问题，而是利用非单调线搜索得到试探步及下一迭代点，有效地减少了计算量。