Abstract In this paper, we present a new framework of bi-level unconstrained minimization for development accelerated methods in Convex Programming. These use approximations the high-order proximal points, which are solutions some auxiliary parametric optimization problems. For computing these can different methods, and, particular, lower-order schemes. This opens possibility latter to overpass...