Auxiliary problem principle extended to variational inequalities
Journal of Optimization Theory and Applications
SIAM Journal on Control and Optimization
Entropy-like proximal methods in convex programming
Mathematics of Operations Research
Family of perturbation methods for variational inequalities
Journal of Optimization Theory and Applications
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
Mathematical Programming: Series A and B
A New Projection Method for Variational Inequality Problems
SIAM Journal on Control and Optimization
A Bundle Method for Solving Variational Inequalities
SIAM Journal on Optimization
Journal of Global Optimization
Computers & Mathematics with Applications
Journal of Global Optimization
Hi-index | 0.00 |
We consider the projected subgradient method for solving generalized mixed variational inequalities. In each step, we choose an @e"k-subgradient u^k of the function f and w^k in a set-valued mapping T, followed by an orthogonal projection onto the feasible set. We prove that the sequence is weakly convergent.