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

DOI10.1155/2013/515902MaRDI QIDQ2015692zbMATH OpenOpenAlexWikidataFDO

Authors Haiwen Xu

Publication date 23 June 2014

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

Copyright license Creative Commons Attribution 3.0 Unported

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

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Iterative procedures involving nonlinear operators (47J25) Variational inequalities (49J40)

Recommendations

• Strong convergence of three-step relaxed hybrid steepest-descent methods for variational inequalities
• Strong convergence of the modified hybrid steepest-descent methods for general variational inequalities
• Strong convergence theorems of relaxed hybrid steepest-descent methods for variational in\-equalities
• Numerical comparison between prediction-correction methods for general variational inequalities
• Finite-step relaxed hybrid steepest-descent methods for variational inequalities

Cites work

• scientific article; zbMATH DE number 4147426 (Why is no real title available?)
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 1040594 (Why is no real title available?)
• scientific article; zbMATH DE number 1131717 (Why is no real title available?)
• scientific article; zbMATH DE number 6270284 (Why is no real title available?)
• A general framework of contraction methods for monotone variational inequalities
• A new method for a class of linear variational inequalities
• Connections among constrained continuous and combinatorial vector optimization
• Convergence analysis of modified hybrid steepest-descent methods with variable parameters for variational inequalities
• Convergence of hybrid steepest-descent methods for variational inequalities
• Efficient implementation of a modified and relaxed hybrid steepest-descent method for a type of variational inequality
• Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
• Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
• New approximation schemes for general variational inequalities
• On a general projection algorithm for variational inequalities
• On semidefinite linear complementarity problems
• Strong convergence of Krasnoselskii and Mann's type sequences for one-parameter nonexpansive semigroups without Bochner integrals
• Strong convergence of three-step relaxed hybrid steepest-descent methods for variational inequalities
• The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
• Three-step relaxed hybrid steepest-descent methods for variational inequalities

Cited in

(2)

• Strong convergence theorems of relaxed hybrid steepest-descent methods for variational in\-equalities
• Strong convergence of three-step relaxed hybrid steepest-descent methods for variational inequalities

This page was built for publication: The strong convergence of prediction-correction and relaxed hybrid steepest-descent method for variational inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015692)