Abstract
We show that Malitsky’s recent Golden Ratio Algorithm for solving convex mixed variational inequalities can be employed in a certain nonconvex framework as well, making it probably the first iterative method in the literature for solving generalized convex mixed variational inequalities, and illustrate this result by numerical experiments.
| Original language | English |
|---|---|
| Pages (from-to) | 565-580 |
| Number of pages | 16 |
| Journal | Journal of Optimization Theory and Applications |
| Volume | 190 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Aug 2021 |
| Externally published | Yes |
Keywords
- Golden Ratio Algorithms
- Proximal point algorithms
- Quasiconvex functions
- Variational inequalities