Γ-robust linear complementarity problems
DOI10.1080/10556788.2020.1825708zbMath1501.90100OpenAlexW2937225311MaRDI QIDQ5038437
Publication date: 30 September 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2020.1825708
linear complementarity problemsrobust optimizationoptimization under uncertainty\(\Gamma\)-robustnesstractable counterparts
Noncooperative games (91A10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Semi-infinite programming (90C34) General equilibrium theory (91B50) Robustness in mathematical programming (90C17)
Related Items (2)
Cites Work
- Solving discretely-constrained Nash-Cournot games with an application to power markets
- Solving discretely constrained, mixed linear complementarity problems with applications in energy
- Robust solution of monotone stochastic linear complementarity problems
- A simple characterization of solutions sets of convex programs
- On extensions of the Frank-Wolfe theorems
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Robust discrete optimization and network flows
- Adjustable robust solutions of uncertain linear programs
- Solving discretely constrained mixed complementarity problems using a median function
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
- Uncertain bimatrix game with applications
- Robust solutions to uncertain linear complementarity problems
- Non-cooperative games
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- On Robust Solutions to Uncertain Linear Complementarity Problems and their Variants
- Stochastic Variational Inequalities: Residual Minimization Smoothing Sample Average Approximations
- Theory and Applications of Robust Optimization
- The Linear Complementarity Problem
- The Price of Robustness
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Light Robustness
- Introduction to Stochastic Programming
- Equilibrium Points of Bimatrix Games
- Expected Residual Minimization Method for Stochastic Linear Complementarity Problems
- New reformulations for stochastic nonlinear complementarity problems
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Equilibrium points in n -person games
- Unnamed Item
- Unnamed Item
This page was built for publication: Γ-robust linear complementarity problems