【摘要】 <正> 1.搜索步长和搜索方向对于无约束最优化问题（?）f（x）,其中f:Rⁿ→R¹,f∈C¹,一般采用形如x_k+1=x_k+λ_kd_k（k=1,2,…）的迭代算法来求解,这里λ_k为搜索步长,d_k为搜索方向.更多还原

【Abstract】 [1] discussed the convergence properties of a kind of special algorithms, which use four inexact line searches. In this paper, we remove the monotonic requirement on line searches in [1], and unify some algorithms, including those which use nonmonotonic line searches associated with the four inexact line searches in [1], into a nonmono tonic algorihtm model. Under mild conditions, we prove the convergence properties of this unified algorithm model.更多还原