On the iteration complexity of some projection methods for monotone linear variational inequalities
From MaRDI portal
Publication:2397469
DOI10.1007/s10957-016-1051-6zbMath1362.90350OpenAlexW2569101633MaRDI QIDQ2397469
Caihua Chen, Xiaoling Fu, Xiao-Ming Yuan, Bing-sheng He
Publication date: 22 May 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-1051-6
Convex programming (90C25) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gradient methods for minimizing composite functions
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Solving a class of linear projection equations
- A new method for a class of linear variational inequalities
- On some non-linear elliptic differential functional equations
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
This page was built for publication: On the iteration complexity of some projection methods for monotone linear variational inequalities