Decomposition method for a class of monotone variational inequality problems
From MaRDI portal
Publication:1964713
DOI10.1023/A:1021736008175zbMath0953.65049OpenAlexW122578774MaRDI QIDQ1964713
Li-Zhi Liao, Hai Yang, Bing-sheng He
Publication date: 23 February 2000
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021736008175
convergencenumerical resultsdecomposition methodminimax problemsaugmented Lagrangian methodmonotone variational inequality
Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Decomposition methods (49M27)
Related Items (5)
Some recent advances in projection-type methods for variational inequalities ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Benders decomposition for a class of variational inequalities ⋮ Decomposition method with a variable parameter for a class of monotone variational inequality problems ⋮ Dantzig-Wolfe decomposition of variational inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Benders decomposition for variational inequalities
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A nonsmooth Newton method for variational inequalities. I: Theory
- A nonsmooth Newton method for variational inequalities. II: Numerical results
- Solving a class of linear projection equations
- A new method for a class of linear variational inequalities
- Network economics: a variational inequality approach
- A class of projection and contraction methods for monotone variational inequalities
- A relaxed projection method for variational inequalities
- Projected gradient methods for linearly constrained problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Iterative methods for variational and complementarity problems
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- An iterative scheme for variational inequalities
- Spatial Market Policy Modeling with Goal Targets
- Transportation Network Policy Modeling with Goal Targets and Generalized Penalty Functions
This page was built for publication: Decomposition method for a class of monotone variational inequality problems
