Random and cyclic projection algorithms for variational inequalities
From MaRDI portal
Publication:5085237
DOI10.1080/02331934.2020.1829620zbMath1492.49015OpenAlexW3092522055MaRDI QIDQ5085237
No author found.
Publication date: 27 June 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1829620
Variational inequalities (49J40) Existence of optimal solutions to problems involving randomness (49J55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random algorithms for convex minimization problems
- On the convergence of a class of outer approximation algorithms for convex programs
- Nonlinear programming and variational inequality problems. A unified approach
- Combined relaxation methods for variational inequalities
- Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
- Incremental constraint projection methods for variational inequalities
- Methodes itératives pour les équations et inéquations aux dérivées partielles non linéaires de type monotone. (Iteration methods for nonlinear equations and inequations with partial derivatives of monotone type)
- Generalized Convexity, Nonsmooth Variational Inequalities, and Nonsmooth Optimization
- An iterative solution of a variational inequality for certain monotone operators in Hilbert space
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A new incremental constraint projection method for solving monotone variational inequalities
- Convex programming in Hilbert space
- Convex Analysis
- Minimization of unsmooth functionals
This page was built for publication: Random and cyclic projection algorithms for variational inequalities