Robust optimization for models with uncertain SOC and SDP constraints
J Zhen (trevorzhengmail.com)
Abstract: In this paper we consider uncertain second-order cone (SOC) and semidefinite programming (SDP) constraints with polyhedral uncertainty. We propose to reformulate an uncertain SOC or SDP constraint as a set of adjustable robust linear optimization constraints with an ellipsoidal or semidefinite representable uncertainty set, respectively. The resulting adjustable problem can then (approximately) be solved by using adjustable robust linear optimization techniques. For example, we show that if linear decision rules are used, then the final robust counterpart consists of SOC or SDP constraints, respectively, which have the same computational complexity as the nominal version with the original constraints. We also propose an efficient method to obtain good lower bounds, and extend our approach to other classes of robust optimization problems. Finally, we apply our approach to a robust regression problem and a robust sensor network problem. We use linear decision rules to solve the resulting adjustable robust linear optimization problems and the solutions found are optimal or near optimal.
Keywords: Robust optimization, second-order cone, semidefinite programming, adjustable robust optimization, linear decision rules.
Category 1: Robust Optimization
Entry Submitted: 12/11/2017
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|