Optimization Online


Nonconvex Robust Optimization

Kwong Meng Teo(kwongmeng***at***alum.mit.edu)

Abstract: We propose a novel robust optimization technique, which is applicable to nonconvex and simulation-based problems. Robust optimization finds decisions with the best worst-case performance under uncertainty. If constraints are present, decisions should also be feasible under perturbations. In the real-world, many problems are nonconvex and involve computer-based simulations. In these applications, the relationship between decision and outcome is not defined through algebraic functions. Instead, that relationship is embedded within complex numerical models. Since current robust optimization methods are limited to explicitly given convex problems, they cannot be applied to many practical problems. Our proposed method, however, operates on arbitrary objective functions. Thus, it is generic and applicable to most real-world problems. It iteratively moves along descent directions for the robust problem, and terminates at a robust local minimum. Because the concepts of descent directions and local minima form the building blocks of powerful optimization techniques, our proposed framework shares the same potential, but for the richer, and more realistic, robust problem. To admit additional considerations including parameter uncertainties and nonconvex constraints, we generalized the basic robust local search. In each case, only minor modifications are required - a testimony to the generic nature of the method, and its potential to be a component of future robust optimization techniques. We demonstrated the practicability of the robust local search technique in two realworld applications: nanophotonic design and Intensity Modulated Radiation Therapy (IMRT) for cancer treatment. In both cases, the numerical models are verified by actual experiments. The method significantly improved the robustness for both designs, showcasing the relevance of robust optimization to real-world problems.

Keywords: Robust optimization; Nonconvex Optimization; Robustness; Implementation errors; Data uncertainty, Implementation Errors, Robust Optimization, Nonconvex Optimization, Constraints, Numerical Optimization, Black Box Optimization, Simulations

Category 1: Robust Optimization

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )

Category 3: Applications -- Science and Engineering

Citation: Teo K.M., "Nonconvex robust optimization", Thesis (Ph. D.), Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2007.

Download: [PDF]

Entry Submitted: 10/23/2009
Entry Accepted: 10/24/2009
Entry Last Modified: 10/23/2009

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society