A class of modified FR conjugate gradient method and applications to non-negative matrix factorization

Abstract

Conjugate gradient method, as an efficient method, is used to solve unconstrained optimization problems. In this paper, we propose a class of modified Fletcher–Reeves conjugate gradient method, with Armijo-type line search, which generates the direction is descent for the objective function. Under mild conditions, we give that the proposed method is descent and globally convergent. Moreover, the method is applied to nonnegative matrix factorization, and the experimental results demonstrate the validity of the proposed method.