We present a new non-nested approach for computing additive upper bounds for callable derivatives using Monte Carlo simulation. It relies on the regression of Greeks computed using adjoint methods. We also show that it is possible to early terminate paths once points of optimal exercise have...

We introduce a set of improvements which allow the calculation of very tight lower bounds for Bermudan derivatives using Monte Carlo simulation. These tight lower bounds can be computed quickly, and with minimal hand-crafting. Our focus is on accelerating policy iteration to the point where it...

The additive method for upper bounds for Bermudan options is rephrased in terms of buyer's and seller's prices. It is shown how to deduce Jamshidian's upper bound result in a simple fashion from the additive method, including the case of possibly zero final pay-off. Both methods are improved by...