Solving asymmetric variational inequalities via convex optimization
From MaRDI portal
Publication:2480044
DOI10.1016/j.orl.2005.09.006zbMath1254.49003OpenAlexW2064799375WikidataQ89218245 ScholiaQ89218245MaRDI QIDQ2480044
Georgia Perakis, Michele Aghassi, Dimitris J. Bertsimas
Publication date: 28 March 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.09.006
Related Items
A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems ⋮ On well-structured convex–concave saddle point problems and variational inequalities with monotone operators ⋮ Imputing a variational inequality function or a convex objective function: a robust approach ⋮ Neural networks for solving second-order cone constrained variational inequality problem ⋮ Stochastic Equilibrium Models for Generation Capacity Expansion ⋮ A stochastic network equilibrium model for electric power markets with uncertain demand ⋮ Pareto-improving congestion pricing on multimodal transportation networks ⋮ Multi-class time reliability-based congestion pricing model based on a degradable transportation network ⋮ Data-driven estimation in equilibrium using inverse optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust linear optimization under general norms.
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems
- Long-step primal path-following algorithm for monotone variational inequality problems
- Nonlinear programming and variational inequality problems. A unified approach
- Robust solutions of uncertain linear programs
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems
- Robust solutions of linear programming problems contaminated with uncertain data
- A unifying geometric solution framework and complexity analysis for variational inequalities
- On some non-linear elliptic differential functional equations
- A polynomial-time algorithm for affine variational inequalities
- Lectures on Modern Convex Optimization
- The Price of Robustness
- On the Solution of Variational Inequalities by the Ellipsoid Method
- Variational principles for variational inequalities
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Variational inequalities
- On the basic theorem of complementarity
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Convex programming and variational inequalities
