New decomposition methods for solving variational inequality problems.
From MaRDI portal
Publication:1410985
DOI10.1016/S0895-7177(03)00016-5zbMath1038.49008OpenAlexW2057220804MaRDI QIDQ1410985
Publication date: 15 October 2003
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(03)00016-5
global convergencedecomposition algorithmsmonotone mappingsvariational inequality problemspartial cocoercive mappings
Related Items
Decomposition Methods Based on Augmented Lagrangians: A Survey, Benders decomposition for a class of variational inequalities, Dantzig-Wolfe decomposition of variational inequalities, A hybrid splitting method for variational inequality problems with separable structure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A note on a globally convergent Newton method for solving monotone variational inequalities
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Application of the alternating direction method of multipliers to separable convex programming problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A proximal-based deomposition method for compositions method for convex minimization problems
- Solving a class of linear projection equations
- A new method for a class of linear variational inequalities
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- New alternating direction method for a class of nonlinear variational inequality problems
- A new stepsize rule in He and Zhou's alternating direction method
- Inexact implicit methods for monotone general variational inequalities
- 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
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Monotone Operators and the Proximal Point Algorithm
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Numerical Solution of Problems in Incompressible Finite Elasticity by Augmented Lagrangian Methods. I. Two-Dimensional and Axisymmetric Problems
- Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
- On the basic theorem of complementarity
- A modified alternating direction method for variational inequality problems.
