Γ‐robust linear complementarity problems with ellipsoidal uncertainty sets

DOI10.1111/itor.12988OpenAlexW3162611210MaRDI QIDQ6092525

No author found.

Publication date: 23 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12988

zbMATH Keywords

linear complementarity problemsrobust optimizationtraffic equilibrium problemsellipsoidal uncertainty sets

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A Frank--Wolfe type theorem for convex polynomial programs
• Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
• Robust solutions to uncertain linear complementarity problems
• On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
• On Robust Solutions to Uncertain Linear Complementarity Problems and their Variants
• Stochastic Variational Inequalities: Residual Minimization Smoothing Sample Average Approximations
• Introduction to Stochastic Programming
• Theory and Applications of Robust Optimization
• The Linear Complementarity Problem
• The Price of Robustness
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Γ-robust linear complementarity problems
• Expected Residual Minimization Method for Stochastic Linear Complementarity Problems
• New reformulations for stochastic nonlinear complementarity problems

This page was built for publication: Γ‐robust linear complementarity problems with ellipsoidal uncertainty sets