Skip to Main content Skip to Navigation
Book sections

A Generalized Proximal Alternating Linearized Method

Abstract : This chapter considers potential games, where agents play, each period, Nash worthwhile moves in alternation, such that their unilateral motivation to change rather than to stay, other players being supposed to stay, are high enough with respect to their resistance to change rather than to stay. This defines a generalized proximal alternating linearized algorithm, where resistance to change plays a major role, perturbation terms of alternating proximal algorithms being seen as the disutilities of net costs of moving.
Complete list of metadatas
Contributor : Elisabeth Lhuillier <>
Submitted on : Thursday, April 11, 2019 - 5:01:58 PM
Last modification on : Wednesday, August 5, 2020 - 3:11:13 AM


  • HAL Id : hal-02097012, version 1



Antoine Soubeyran, João Carlos O. Souza, Joao Xavier Cruz Neto. A Generalized Proximal Alternating Linearized Method. Variational Analysis and Set Optimization, pp.55-89, 2019, 978-1-138-03726-7. ⟨hal-02097012⟩



Record views