摘要
This paper proposes a direct search frame-based adaptive Barzilai-Borwein method for unconstrained minimization. The method is based on the framework of frame-based algorithms proposed by Coope and Price, but we use the strategy of ABB method and the rotational minimal positive basis to reduce the computation work at each iteration. Under some mild assumptions, the convergence of this approach will be established. Through five hundreds and twenty numerical tests using the CUTEr test problem library, we show that the proposed method is promising.
This paper proposes a direct search frame-based adaptive Barzilai-Borwein method for unconstrained minimization. The method is based on the framework of frame-based algorithms proposed by Coope and Price, but we use the strategy of ABB method and the rotational minimal positive basis to reduce the computation work at each iteration. Under some mild assumptions, the convergence of this approach will be established. Through five hundreds and twenty numerical tests using the CUTEr test problem library, we show that the proposed method is promising.
基金
Acknowledgments. This work was supported by the National Natural Science Founda- tion of China （11071117, 11274109） and the Natural Science Foundation of Jiangsu Province （BK20141409）.
