The hybrid steepest descent method for solving variational inequality over triple hierarchical problems
DOI10.1186/1029-242X-2012-280zbMATH Open1278.47087OpenAlexW2125672512WikidataQ59289213 ScholiaQ59289213MaRDI QIDQ388083FDOQ388083
Authors: Nopparat Wairojjana, Thanyarat Jitpeera, Poom Kumam 
Publication date: 18 December 2013
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1029-242x-2012-280
Recommendations
- Hybrid steepest-descent methods for triple hierarchical variational inequalities
- Hybrid implicit steepest-descent methods for triple hierarchical variational inequalities with hierarchical variational inequality constraints
- Hybrid steepest descent viscosity method for triple hierarchical variational inequalities
- Hybrid steepest-descent methods for triple hierarchical variational inequalities
- Composite steepest-descent method for the triple hierarchical variational inequalities
nonexpansive mappingstrong convergencevariational inequalityhierarchical fixed pointLipschitz continuousstrongly monotone mappingstrongly positive linear bounded operator
Iterative procedures involving nonlinear operators (47J25) Variational inequalities (49J40) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- On some non-linear elliptic differential functional equations
- Strong convergence of Krasnoselskii and Mann's type sequences for one-parameter nonexpansive semigroups without Bochner integrals
- A general iterative method for nonexpansive mappings in Hilbert spaces
- Iterative Algorithms for Nonlinear Operators
- A subgradient-type method for the equilibrium problem over the fixed point set and its applications
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- A Fixed Point Theorem for Mappings which do not Increase Distances
- Iterative algorithms for hierarchical fixed points problems and variational inequalities
- Explicit hierarchical fixed point approach to variational inequalities
- Iterative selection methods for common fixed point problems
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method
Cited In (12)
- An explicit algorithm for solving the optimize hierarchical problems
- A new iterative algorithm for split solution problems of quasi-nonexpansive mappings
- Hybrid steepest-descent viscosity methods for triple hierarchical variational inequalities with constraints of mixed equilibria and bilevel variational inequalities
- The hybrid steepest descent method for solutions of equilibrium problems and other problems in fixed point theory
- Algorithms for solving the variational inequality problem over the triple hierarchical problem
- Hybrid steepest descent viscosity method for triple hierarchical variational inequalities
- A unified implicit algorithm for solving the triple-hierarchical constrained optimization problem
- Composite steepest-descent method for the triple hierarchical variational inequalities
- Hybrid implicit steepest-descent methods for triple hierarchical variational inequalities with hierarchical variational inequality constraints
- Relaxed hybrid steepest-descent methods with variable parameters for triple-hierarchical variational inequalities
- Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization
- Hybrid steepest-descent methods for triple hierarchical variational inequalities
This page was built for publication: The hybrid steepest descent method for solving variational inequality over triple hierarchical problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388083)
