Weak co-coercivity and its applications in several algorithms for solving variational inequalities

DOI10.1016/j.amc.2007.12.013zbMath1158.65048OpenAlexW1996421894MaRDI QIDQ945238

Qingzhi Yang, Jin-Ling Zhao

Publication date: 12 September 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.12.013

zbMATH Keywords

convergenceVariational inequalityproximal point methodmaximal monotoneforward-backward splitting methodArmijo-like searchauxiliary problem methodsub-strong monotonicityweak co-coercivity

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Discrete approximations in optimal control (49M25)

Cites Work

• Auxiliary problem principle extended to variational inequalities
• A logarithmic-quadratic proximal method for variational inequalities
• On variable-step relaxed projection algorithm for variational inequalities
• The revisit of a projection algorithm with variable steps for variational inequalities
• On the convergence of projection methods: Application to the decomposition of affine variational inequalities
• Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
• A note on the CQ algorithm for the split feasibility problem

This page was built for publication: Weak co-coercivity and its applications in several algorithms for solving variational inequalities