Abstract
Complex systems can be optimized to improve the performance with respect to desired functionalities. An optimized solution, however, can become suboptimal or even infeasible, when errors in implementation or input data are encountered. We report on a robust simulated annealing algorithm that does not require any knowledge of the problems structure. This is necessary in many engineering applications where solutions are often not explicitly known and have to be obtained by numerical simulations. While this nonconvex and global optimization method improves the performance as well as the robustness, it also warrants for a global optimum which is robust against data and implementation uncertainties. We demonstrate it on a polynomial optimization problem and on a high-dimensional and complex nanophotonic engineering problem and show significant improvements in efficiency as well as in actual optimality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Petroski H.: Design Paradigms. Cambridge University Press, Cambridge (1994)
Ben-Tal A., Nemirovski A.: Robust optimization—methodology and applications. Math. Progr. 92, 453 (2002)
Ben-Tal A., Nemirovski A.: Robust convex optimization. Math. Oper. Res. 23, 769 (1998)
Bertsimas D., Sim M.: Tractable approximations to Robust conic optimization. Math. Progr. 107, 5 (2006)
Bertsimas D., Sim M.: Robust discrete optimization and network flows. Math. Progr. 98, 49 (2003)
Bertsimas D., Nohadani O., Teo K.: Robust optimization in electromagnetic scattering problems. J. Appl. Phys. 101, 074507 (2007)
Levi A.F.J., Haas S.: Optimal Device Design, Chap. 6. Cambridge University Press, Cambridge (2010)
Bertsimas, D., Nohadani, O., Teo, K.: Robust optimization for unconstrained simulation-based problems. Oper. Research (to appear 2009). doi:10.1287/opre.1090.0715
Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific (1995)
Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific (1997)
Hartmann A.K., Rieger H.: New Optimization Algorithms in Physics. Wiley-VCH, New York (2004)
Kirkpatrick S., Gelatt C., Vecchi M.: Optimization by simmulated annealing. Science 220, 671 (1983)
Metropolis N., Rosenbluth A., Teller M., Teller E.: Equations of state calculations by fast computing machines. J. Chem. Phys. 21, 1087 (1953)
Geman S., Geman D.: Stochastic relaxation, Gibbs distributions, and bayesian resoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 6, 721 (1984)
Ingber L., Rosen B.: Genetic algorithms and very fast simulated reannealing: a comparison. J. Math. Comput. Model. 16, 87 (1992)
Henrion D., Lasserre J.B.: GloptiPoly: global optimization over polynomials with matlab and SeDuMi. ACM Trans. Math. Softw. 29, 165–194 (2003)
Lasserre J.B.: A moment approach to analyze zeros of triangular polynomials sets. Math. Program Ser. B 107, 275–293 (2006)
Kojima, M.: Sums of squares relaxations of polynomical semidefinite programs. Research report B-397, Tokyo Institute of Technology (2003)
Joannopoulos J.D., Villeneuve P.R., Fan S.: Photonic crystals: putting a new twist on light. Nature 386, 143 (1997)
Geremia J.M., Williams J., Mabuchi H.: Inverse-problem approach to designing photonic crystals for cavity QED experiments. Phys. Rev. E 66, 066606 (2002)
Seliger P., Mahvash M., Wang C., Levi A.: Optimization of aperiodic dielectric structures. J. Appl. Phys. 100, 034310 (2006)
Ingber L.: Very fast simulated re-annealing. J. Math. Comput. Model. 12, 967 (1989)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bertsimas, D., Nohadani, O. Robust optimization with simulated annealing. J Glob Optim 48, 323–334 (2010). https://doi.org/10.1007/s10898-009-9496-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-009-9496-x