A class of Dantzig-Wolfe type decomposition methods for variational inequality problems
From MaRDI portal
Publication:2436644
DOI10.1007/s10107-012-0599-7zbMath1286.90112OpenAlexW2168919203MaRDI QIDQ2436644
Juan Pablo Luna, Claudia A. Sagastizábal, Mikhail V. Solodov
Publication date: 25 February 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0599-7
decompositionvariational inequalityDantzig-Wolfe decompositionvariational equilibriumJacobi approximationJosephy-Newton approximation
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items
An approximation scheme for a class of risk-averse stochastic equilibrium problems, Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization, A class of Benders decomposition methods for variational inequalities, Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games, Solving equilibrium problems using extended mathematical programming, On error bounds and Newton-type methods for generalized Nash equilibrium problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the variational equilibrium as a refinement of the generalized Nash equilibrium
- Dantzig-Wolfe decomposition of variational inequalities
- On the choice of explicit stabilizing terms in column generation
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Interfaces to PATH 3.0: Design, implementation and usage
- Multicommodity network flows: The impact of formulation on decomposition
- A proximal-based deomposition method for compositions method for convex minimization problems
- Combined relaxation methods for variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- Revisiting generalized Nash games and variational inequalities
- Comparison of bundle and classical column generation
- Local boundedness of nonlinear, monotone operators
- On generalized Nash games and variational inequalities
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- Addressing supply-side risk in uncertain power markets: stochastic Nash models, scalable algorithms and error analysis
- Subproblem Approximation in Dantzig-Wolfe Decomposition of Variational Inequality Models with an Application to a Multicommodity Economic Equilibrium Model
- A Complementarity Framework for Forward Contracting Under Uncertainty
- The Decomposition Algorithm for Linear Programs
- Nash-Cournot Equilibria in Electric Power Markets with Piecewise Linear Demand Functions and Joint Constraints
- A Class of Inexact Variable Metric Proximal Point Algorithms
- Applications of the method of partial inverses to convex programming: Decomposition
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Monotone Operators and the Proximal Point Algorithm
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A SPLITTING METHOD FOR COMPOSITE MAPPINGS
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- On the Maximality of Sums of Nonlinear Monotone Operators
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Generalized Nash equilibrium problems
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
