An improved proximal alternating direction method for monotone variational inequalities with separable structure
type: Item
instance of: scholarly article
title: An improved proximal alternating direction method for monotone variational inequalities with separable structure
zbMATH Open document ID: 1219.90174
published in: Computational Optimization and Applications
publication date: 2011-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 5903811
zbMATH Keywords: variational inequalities
zbMATH Keywords: separable structure
zbMATH Keywords: proximal point method
zbMATH Keywords: alternating direction method
zbMATH Keywords: descent method
author: Xiaoming Yuan
MaRDI profile type: Publication
full work available at URL: s10589-009-9293-y
OpenAlex ID: W1992408309
cites work: Q4001523
cites work: Q4821526
cites work: A proximal-based deomposition method for compositions method for convex minimization problems
cites work: On the basic theorem of complementarity
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: Q4311908
cites work: Q3038523
cites work: Application of the alternating direction method of multipliers to separable convex programming problems
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: Q3321366
cites work: An alternating projections method for certain linear problems in a Hilbert space
cites work: New Proximal Point Algorithms for Convex Minimization
cites work: Self-adaptive inexact proximal point methods
cites work: Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
cites work: Q3477904
cites work: A new inexact alternating directions method for monotone variational inequalities
cites work: Comparison of two kinds of prediction-correction methods for monotone variational inequalities
cites work: Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
cites work: A variable-penalty alternating directions method for convex optimization
cites work: Network economics: a variational inequality approach
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Modified Projection-Type Methods for Monotone Variational Inequalities
cites work: A class of iterative methods for solving nonlinear projection equations
cites work: A globally convergent Newton method for solving strongly monotone variational inequalities
cites work: Convergence of Proximal-Like Algorithms
cites work: Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
cites work: Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
cites work: A descent method for structured monotone variational inequalities
DOI: 10.1007/S10589-009-9293-Y
description: scientific article; zbMATH DE number 5903811