期刊
INFORMS JOURNAL ON COMPUTING
卷 22, 期 1, 页码 44-58出版社
INFORMS
DOI: 10.1287/ijoc.1090.0319
关键词
optimization; robust optimization; nonconvex optimization; constraints
资金
- [DARPA-N666001-05-1-6030]
We propose a new robust optimization method for problems with objective functions that may be computed via numerical simulations and incorporate constraints that need to be feasible under perturbations. The proposed method iteratively moves along descent directions for the robust problem with nonconvex constraints and terminates at a robust local minimum. We generalize the algorithm further to model parameter uncertainties. We demonstrate the practicability of the method in a test application on a nonconvex problem with a polynomial cost function as well as in a real-world application to the optimization problem of intensity-modulated radiation therapy for cancer treatment. The method significantly improves the robustness for both designs.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据