  In this paper, two types of nonmonotone memory gradient algorithm for solving
unconstrained multiobjective optimization problems are introduced. Under some
suitable conditions, we show the convergence of the full sequence generated by
the proposed algorithms to a weak Pareto optimal point
