Abstract: It was shown recently [1] that stochastic control problems with non-classical information patterns can be cast equivalently as nonconvex optimization problems and that lower bounds could be ...

We propose a new decomposition method for large-scale linear programming. This method dualizes an (arbitrary) subset of the constraints and then maximizes the resulting dual functional by dual ascent.