Before revision:  Compared with the SAA approach, the computational complexity of the proposed algorithm is drastically reduced from O(\epsilon^T) to O( T^3) per time stage , where T is the total number of the time stagesand \epsilon is a constant related to the accuracy of the solution.
After revision:  Compared with the SAA approach, the computational complexity of the proposed algorithm is drastically reduced from O(\epsilon^T) to O( T^3) , where T is the total number of the time stagesand \epsilon is a constant related to the accuracy of the solution.