The strong convergence of prediction-correction and relaxed hybrid steepest-descent method for variational inequalities

DOI10.1155/2013/515902zbMath1291.90267WikidataQ58916977 ScholiaQ58916977MaRDI QIDQ2015692

Haiwen Xu

Publication date: 23 June 2014

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/515902

Mathematics Subject Classification ID

49J40: Variational inequalities

47J25: Iterative procedures involving nonlinear operators

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient implementation of a modified and relaxed hybrid steepest-descent method for a type of variational inequality
• Convergence of hybrid steepest-descent methods for variational inequalities
• Three-step relaxed hybrid steepest-descent methods for variational inequalities
• Strong convergence of three-step relaxed hybrid steepest-descent methods for variational inequalities
• Convergence analysis of modified hybrid steepest-descent methods with variable parameters for variational inequalities
• On a general projection algorithm for variational inequalities
• A new method for a class of linear variational inequalities
• On semidefinite linear complementarity problems
• New approximation schemes for general variational inequalities
• Strong convergence of Krasnoselskii and Mann's type sequences for one-parameter nonexpansive semigroups without Bochner integrals
• Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
• Connections among constrained continuous and combinatorial vector optimization
• Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings