In order to combine the good theoretical properties of Conjugate Descent (CD) method and the good numerical effect of Liu-Storey (LS) method, it is necessary to reduce the adverse effect of small steps on iteration, and make the decline of search direction independent of the selection of line search. By mixing the molecules of the CD method and the LS method, the gradient function was modified accordingly. The sufficient descent of direction is independent of the selection of line search and can be applied to a variety of line searches. Based on the Wolfe line search, the global convergence of the algorithm is proved. The results of 42 classes of unconstrained test function and image denoising show that based on the same termination conditions, the number of iterations and iteration time of the proposed algorithm are lower than those of the previous three types of conjugate gradient algorithms.