Splitting algorithms for solving state-dependent maximal monotone inclusion problems
We consider the state-dependent maximal monotone inclusion problem and propose forward-backward splitting algorithms for solving it. Strong convergence of the proposed algorithms is established under suitable conditions. For the special separable case, we present an improved Douglas-Rachford variant...
Uloženo v:
| Vydáno v: | Optimization Ročník 74; číslo 9; s. 2113 - 2136 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Taylor & Francis
04.07.2025
|
| Témata: | |
| ISSN: | 0233-1934, 1029-4945 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | We consider the state-dependent maximal monotone inclusion problem and propose forward-backward splitting algorithms for solving it. Strong convergence of the proposed algorithms is established under suitable conditions. For the special separable case, we present an improved Douglas-Rachford variant that can be easily implemented. Moreover, some accelerated forward-backward splitting algorithms are also presented. Preliminary numerical experiments with comparisons to existing results are presented, illustrating the advantages of our methods. |
|---|---|
| ISSN: | 0233-1934 1029-4945 |
| DOI: | 10.1080/02331934.2024.2341942 |