Primal and dual problems of optimal control in the format of convex problems of Bolza can simultaneously be solved by a specialized application of the progressive decoupling algorithm by translating them to a linkage problem format. Although explained and justified here only in pure form, the procedure has the unprecedented feature that, in each iteration, the minimization subproblem decomposes into a separate proximal minimization subproblem at each instant of time, along with another proximal minimization concerning a trajectory's initial point and terminal point.