It is well known that the robust counterpart introduced by Ben-Tal and Nemirovski  increases the numerical complexity of the solution compared to the original problem. Kocvara, Nemirovski and Zowe therefore introduced in  an approximation algorithm for the special case of robust material optimization, called cascading. As the title already indicates, we will show that their method can be seen as an adjustment of standard exchange methods to semi-infinite conic programming. We will see that the adjustment can be motivated by a suitable reformulation of the robust conic problem.
R. Werner, 2008, Cascading: an adjusted exchange method for robust conic programming. Central European Journal of Operations Research, 2008, 16 (2), pp 179 – 189.