The strong convergence of prediction-correction and relaxed hybrid steepest-descent method for variational inequalities
DOI10.1155/2013/515902zbMATH Open1291.90267OpenAlexW2125212852WikidataQ58916977 ScholiaQ58916977MaRDI QIDQ2015692FDOQ2015692
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
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Iterative procedures involving nonlinear operators (47J25) Variational inequalities (49J40)
Cites Work
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- Title not available (Why is that?)
- Convergence of hybrid steepest-descent methods for variational inequalities
- New approximation schemes for general variational inequalities
- Strong convergence of Krasnoselskii and Mann's type sequences for one-parameter nonexpansive semigroups without Bochner integrals
- Title not available (Why is that?)
- A new method for a class of linear variational inequalities
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient implementation of a modified and relaxed hybrid steepest-descent method for a type of variational inequality
- 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 semidefinite linear complementarity problems
- Title not available (Why is that?)
- On a general projection algorithm for variational inequalities
- Title not available (Why is that?)
- Connections among constrained continuous and combinatorial vector optimization
Cited In (2)
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 π π
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)