A new decomposition method for variational inequalities with linear constraints

DOI10.1007/s10957-011-9931-2zbMath1237.90238OpenAlexW1966623947MaRDI QIDQ415382

Gang Qian, Deren Han, Min Zhang, Xi-Hong Yan

Publication date: 8 May 2012

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-011-9931-2

zbMATH Keywords

global convergencevariational inequalitiesdecomposition methodsapproximate solutionself-adaptive

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inexact operator splitting methods with selfadaptive strategy for variational inequality problems
• An operator splitting method for variational inequalities with partially unknown mappings
• A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
• Self-adaptive implicit methods for monotone variant variational inequalities
• 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 variable-penalty alternating directions method for convex optimization
• Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
• 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
• Self-adaptive operator splitting methods for monotone variational inequalities
• A proximal decomposition algorithm for variational inequality problems.
• Solving variational inequality problems with linear constraints by a proximal decomposition algorithm
• 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 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
• Semi-Definite Matrix Constraints in Optimization
• Projection methods for variational inequalities with application to the traffic assignment problem
• Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A simple proof for some important properties of the projection mapping
• Transportation Network Policy Modeling with Goal Targets and Generalized Penalty Functions
• A modified alternating direction method for variational inequality problems.
• Improvements of some projection methods for monotone nonlinear variational inequalities
• Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities

This page was built for publication: A new decomposition method for variational inequalities with linear constraints