A proximal decomposition algorithm for variational inequality problems.
From MaRDI portal
Publication:1412829
DOI10.1016/j.cam.2003.08.001zbMath1041.65053OpenAlexW2015741291MaRDI QIDQ1412829
Publication date: 25 November 2003
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2003.08.001
global convergencevariational inequalitiesnumerical examplesdecomposition algorithmsmonotone mappings
Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Decomposition methods (49M27)
Related Items (8)
New hybrid conjugate gradient projection method for the convex constrained equations ⋮ A new decomposition method for variational inequalities with linear constraints ⋮ A modified extragradient method for multi-valued variational inequality problems ⋮ Two new self-adaptive descent methods without line search for co-coercive structured variational inequality problems ⋮ An inexact alternating direction method for structured variational inequalities ⋮ A projection-based prediction-correction method for structured monotone variational inequalities ⋮ A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints ⋮ A new algorithm for solving multi-valued variational inequality problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on a globally convergent Newton method for solving monotone variational inequalities
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Solving a class of linear projection equations
- A new method for a class of linear variational inequalities
- Solving variational inequality problems with linear constraints by a proximal decomposition algorithm
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Solving a class of asymmetric variational inequalities by a new alternating direction method
- New alternating direction method for a class of nonlinear variational inequality problems
- A new inexact alternating directions method for monotone variational inequalities
- A new stepsize rule in He and Zhou's alternating direction method
- A modified alternating direction method for convex minimization problems
- A class of projection and contraction methods for monotone variational inequalities
- A globally convergent Newton method for solving strongly monotone variational inequalities
- Projection methods for variational inequalities with application to the traffic assignment problem
- Monotone Operators and the Proximal Point Algorithm
- Computing stationary points
- Transportation Network Policy Modeling with Goal Targets and Generalized Penalty Functions
- A modified alternating direction method for variational inequality problems.
This page was built for publication: A proximal decomposition algorithm for variational inequality problems.
