This paper is concerned with finding an optimal algorithm for minimizing a composite convex objective function. The basic setting that the sum of two functions: first function smooth up to dth-order derivative information available, and second possibly nonsmooth, but its proximal tensor mappings can be computed approximately in efficient manner. problem find—in setting—the best possible (optima...