Splitting-type method for systems of variational inequalities
From MaRDI portal
Publication:2567177
DOI10.1016/j.cor.2004.06.019zbMath1116.49006OpenAlexW2046372450MaRDI QIDQ2567177
Publication date: 29 September 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.06.019
Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Set-valued and variational analysis (49J53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) General equilibrium theory (91B50)
Related Items (8)
Two algorithms for solving systems of inclusion problems ⋮ Egoist's dilemma with interval data ⋮ Two new splitting algorithms for equilibrium problems ⋮ A direct splitting method for nonsmooth variational inequalities ⋮ A variable metric proximal-descent algorithm for monotone operators ⋮ An extension of Luque's growth condition ⋮ Forward–backward-based descent methods for composite variational inequalities ⋮ On systems of extended primal–dual variational inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial inverse of a monotone operator
- Auxiliary problem principle extended to variational inequalities
- On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Generalized variational inequalities
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Nonlinear programming and variational inequality problems. A unified approach
- Equilibrium programming using proximal-like algorithms
- A combined relaxation method for variational inequalities with nonlinear constraints
- Combined relaxation method for generalized variational inequalities
- A general approach to the determination of stationary points and the solution of related problems.
- Equilibrium programming: Proximal methods
- On combined relaxation methods' convergence rates
- The convergence of proximal methods to fixed points of extremal mappings and estimates of their rate of convergence
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- New variants of bundle methods
- Combined relaxation methods for variational inequality problems over products sets
- Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convergence Rates in Forward--Backward Splitting
- A combined relaxation method for decomposable variational inequalities*
- A combined method for variational inequalities with monotone operators
- Pseudomonotone variational inequalities: Convergence of proximal methods
This page was built for publication: Splitting-type method for systems of variational inequalities