The distributionally robust optimization reformulation for stochastic complementarity problems
Summary: We investigate the stochastic linear complementarity problem affinely affected by the uncertain parameters. Assuming that we have only limited information about the uncertain parameters, such as the first two moments or the first two moments as well as the support of the distribution, we formulate the stochastic linear complementarity problem as a distributionally robust optimization reformation which minimizes the worst case of an expected complementarity measure with nonnegativity constraints and a distributionally robust joint chance constraint representing that the probability of the linear mapping being nonnegative is not less than a given probability level. Applying the cone dual theory and S-procedure, we show that the distributionally robust counterpart of the uncertain complementarity problem can be conservatively approximated by the optimization with bilinear matrix inequalities. Preliminary numerical results show that a solution of our method is desirable.
- The distributionally robust complementarity problem
- Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches
- Robust solutions to uncertain linear complementarity problems
- Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints
- Unconstrained optimization reformulation of stochastic linear complementary problems
- A Definition of Uncertainty Aversion
- A Survey of the S-Lemma
- Combined Monte Carlo sampling and penalty method for stochastic nonlinear complementarity problems
- CVaR-based formulation and approximation method for stochastic variational inequalities
- Distributionally robust joint chance constraints with second-order moment information
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Engineering and Economic Applications of Complementarity Problems
- Expected Residual Minimization Method for Stochastic Linear Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- From CVaR to uncertainty set: implications in joint chance-constrained optimization
- Maxmin expected utility with non-unique prior
- On distributionally robust chance-constrained linear programs
- On duality theory of conic linear problems.
- Robust solutions to uncertain linear complementarity problems
- Sample-path solution of stochastic variational inequalities
- Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems
- Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints
- The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems
- The distributionally robust complementarity problem
- Practicable robust stochastic optimization under divergence measures with an application to equitable humanitarian response planning
This page was built for publication: The distributionally robust optimization reformulation for stochastic complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1724184)
