-

 

 

 




Optimization Online





 

Extending the Scope of Robust Quadratic Optimization

Ahmadreza Marandi (A.marandi***at***tue.nl)
Aharon Ben-Tal (abental***at***ie.technion.ac.il)
Dick den Hertog (d.denhertog***at***uvt.nl)
Bertrand Melenberg (b.melenberg***at***uvt.nl)

Abstract: We derive computationally tractable formulations of the robust counterparts of convex quadratic and conic quadratic constraints that are concave in matrix-valued uncertain parameters. We do this for a broad range of uncertainty sets. In particular, we show how to reformulate the support functions of uncertainty sets represented in terms of matrix norms and cones. Our results provide extensions to known results from the literature. We also consider hard quadratic constraints; those that are convex in uncertain matrix-valued parameters. For the robust counterpart of such constraints we derive inner and outer tractable approximations. As application, we show how to construct a natural uncertainty set based on a statistical confidence set around a sample mean vector and covariance matrix and use this to provide a tractable reformulation of the robust counterpart of an uncertain portfolio optimization problem. We also apply the results of this paper to a norm approximation and a regression line problem.

Keywords: Robust optimization, Quadratic programming, Safe approximation, Mean-variance uncertainty

Category 1: Robust Optimization

Category 2: Nonlinear Optimization (Quadratic Programming )

Citation:

Download: [PDF]

Entry Submitted: 05/19/2017
Entry Accepted: 05/19/2017
Entry Last Modified: 09/04/2019

Modify/Update this entry


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

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society