Abstract
It is well known that the robust counterpart introduced by Ben-Tal and Nemirovski (Math Oper Res 23:769–805, 1998) increases the numerical complexity of the solution compared to the original problem. Kočvara, Nemirovski and Zowe therefore introduced in Kočvara et al. (Comput Struct 76:431–442, 2000) 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Asic MD and Kovacevic-Vuijcic VV (1988). An interior semi-infinite programming method. J Optim Theory Appl 59(3): 353–367
Ben-Tal A and Nemirovski A (1998). Robust convex optimization. Math Oper Res 23: 769–805
Ben-Tal A, Nemirovski A and Roos C (2002). Robust solutions of uncertain quadratic and conic-quadratic problems. SIAM J Optim 13(2): 535–560
Ben-Tal A and Nemirovski A (2002). Robust optimization—methodology and applications. Math Program 92(3): 453–480
Bertsimas D and Sim M (2006). Tractable approximations to robust conic optimization problems. Math Program 107(1): 5–36
Calafiore G and Campi MC (2005). Uncertain convex programs: randomized solutions and confidence levels. Math Program 102(1): 25–46
Floudas CA, Stein O (2006) The adaptive convexification algorithm: a feasible point method for semi-infinite programming. Preprint No. 116, Department of Mathematics—C, RWTH Aachen University
Gomez JA and Gomez W (2006). Cutting plane algorithms for robust conic convex optimization problems. Optim Methods Softw 21(5): 779–803
Kočvara M and Stingl M (2003). PENNON—a code for convex nonlinear and semidefinite programming. Optim Methods Softw 18(3): 317–333
Kočvara M, Zowe J and Nemirovski A (2000). Cascading—an approach to robust material optimization. Comput Struct 76: 431–442
Luenberger DG (1969). Optimization by vector space methods. Wiley, New York
Reemtsen R, Görner S (1998) Numerical methods for semi-infinite programming: a survey. In: Semi-infinite programming. Kluwer, Dortrecht
Reemtsen R and Rückmann J-J (1998). Semi-infinite programming. Kluwer, Dortrecht
Rockafellar RT (1997). Convex analysis. Princeton University Press, Princeton
Schöttle K and Werner R (2005). Costs and benefits of robust optimization. Working Paper, TU München
Vandenberghe L, Boyd S (1998) Connections between semi-infinite and semi-definite programming. In: Semi-infinite programming. Kluwer, Dortrecht
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Werner, R. Cascading: an adjusted exchange method for robust conic programming. cent.eur.j.oper.res. 16, 179–189 (2008). https://doi.org/10.1007/s10100-007-0047-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-007-0047-6