Solving variational inequality problems with linear constraints by a proximal decomposition algorithm

DOI10.1023/B:JOGO.0000006717.61873.2czbMath1036.49017OpenAlexW2078468184WikidataQ59297281 ScholiaQ59297281MaRDI QIDQ1424963

Deren Han, Hong Kam Lo

Publication date: 15 March 2004

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jogo.0000006717.61873.2c

zbMATH Keywords

Global convergenceMonotone mappingsVariational inequality problemsDecomposition algorithmsInexact method

Mathematics Subject Classification ID

Variational inequalities (49J40)

Related Items (6)

A new decomposition method for variational inequalities with linear constraints ⋮ Two new self-adaptive descent methods without line search for co-coercive structured variational inequality problems ⋮ A proximal decomposition algorithm for variational inequality problems. ⋮ An inexact alternating direction method for structured variational inequalities ⋮ A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints ⋮ A simple self-adaptive alternating direction method for linear variational inequality problems

This page was built for publication: Solving variational inequality problems with linear constraints by a proximal decomposition algorithm