On Robust Solutions to Uncertain Linear Complementarity Problems and their Variants
From MaRDI portal
Publication:2828336
DOI10.1137/15M1010427zbMath1366.90151arXiv1503.03490MaRDI QIDQ2828336
Publication date: 25 October 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.03490
Noncooperative games (91A10) Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Semi-infinite programming (90C34) Traffic problems in operations research (90B20)
Related Items (13)
Γ-robust linear complementarity problems ⋮ Affinely Adjustable Robust Linear Complementarity Problems ⋮ Two-stage stochastic variational inequalities: an ERM-solution procedure ⋮ Expected residual minimization formulation for a class of stochastic linear second-order cone complementarity problems ⋮ Robust market equilibria under uncertain cost ⋮ Distributionally robust stochastic variational inequalities ⋮ Γ‐robust linear complementarity problems with ellipsoidal uncertainty sets ⋮ Sample average approximation of conditional value-at-risk based variational inequalities ⋮ Stochastic \(R_0\) matrix linear complementarity problems: the Fischer-Burmeister function-based expected residual minimization ⋮ Robust weighted expected residual minimization formulation for stochastic vector variational inequalities ⋮ Nonconvex robust programming via value-function optimization ⋮ Games with distributionally robust joint chance constraints ⋮ Unconstrained optimization reformulation for stochastic nonlinear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spatial oligopolistic equilibria with arbitrage, shared resources, and price function conjectures.
- Robust solution of monotone stochastic linear complementarity problems
- A note on the existence of traffic equilibria
- NP-completeness of the linear complementarity problem
- The ellipsoid method and its consequences in combinatorial optimization
- A class of gap functions for variational inequalities
- On global optimization with indefinite quadratics
- Robust integer programming
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- Robust solutions to uncertain linear complementarity problems
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Randomized algorithms for probabilistic robustness with real and complex structured uncertainty
- Stochastic Variational Inequalities: Residual Minimization Smoothing Sample Average Approximations
- Theory and Applications of Robust Optimization
- Stochastic $R_0$ Matrix Linear Complementarity Problems
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Stochastic algorithms for exact and approximate feasibility of robust LMIs
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Nash Equilibrium Problems With Scaled Congestion Costs and Shared Constraints
- Expected Residual Minimization Method for Stochastic Linear Complementarity Problems
This page was built for publication: On Robust Solutions to Uncertain Linear Complementarity Problems and their Variants