Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's (Q3530144)
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 5351710
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's |
scientific article; zbMATH DE number 5351710 |
Statements
15 October 2008
0 references
convex optimization
0 references
alternating minimization
0 references
splitting methods
0 references
proximal algorithm
0 references
weak coupling
0 references
quadratic coupling
0 references
costs to change
0 references
anchoring effect
0 references
dynamical games
0 references
best response
0 references
domain decomposition for PDE's
0 references
monotone inclusions
0 references
0.8538490533828735
0 references
0.8433531522750854
0 references
0.8406915664672852
0 references
0.8381710052490234
0 references
0.8123622536659241
0 references
