On Gabay's algorithms for mixed variational inequalities (Q2365242)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 969289
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Gabay's algorithms for mixed variational inequalities |
scientific article; zbMATH DE number 969289 |
Statements
On Gabay's algorithms for mixed variational inequalities (English)
0 references
30 October 1997
0 references
The author discusses various algorithms for solving maximal monotone inclusion, due to \textit{D. Gabay} [in M. Fortin and R. Glowinski (eds.), Méthodes de Lagrangian Augmenté, 279-307 (1982; Zbl 0491.65036)], \textit{P. L. Lions} and \textit{B. Mercier} [SIAM J. Numer. Anal. 16, 964-979 (1979; Zbl 0426.65050)], and \textit{A. Bermudez} and \textit{C. Moreno} [Comput. Math. Appl. 7, 43-58 (1981; Zbl 0456.65036)], and others, in term of resolvent operators. He discusses also the application of these algorithms to discretized time dependent variational inequalities.
0 references
proximal point
0 references
convex optimization
0 references
duality
0 references
numerical algorithms
0 references
algorithms
0 references
maximal monotone inclusion
0 references
resolvent operators
0 references
variational inequalities
0 references
0.7901449203491211
0 references
0.7790851593017578
0 references
0.7734520435333252
0 references
0.7677419781684875
0 references
