Relaxed hybrid steepest-descent methods with variable parameters for triple-hierarchical variational inequalities
DOI10.1080/00036811.2011.614602zbMATH Open1252.49009OpenAlexW1963984228WikidataQ58187540 ScholiaQ58187540MaRDI QIDQ3143358FDOQ3143358
Authors: L. C. Ceng, Qamrul Hasan Ansari, Jen-Chih Yao 
Publication date: 29 November 2012
Published in: Applicable Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00036811.2011.614602
Recommendations
- Hybrid steepest-descent methods for triple hierarchical variational inequalities
- scientific article; zbMATH DE number 6418068
- Hybrid steepest-descent methods for triple hierarchical variational inequalities
- The hybrid steepest descent method for solving variational inequality over triple hierarchical problems
- Approximation methods for triple hierarchical variational inequalities. II
relaxed hybrid steepest-descent methodfixed-points of a nonexpansive mappingtriple-hierarchical variational inequality
Numerical optimization and variational techniques (65K10) Fixed-point theorems (47H10) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40)
Cites Work
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Convergence of hybrid steepest-descent methods for variational inequalities
- Iterative Algorithms for Nonlinear Operators
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Title not available (Why is that?)
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Krasnoselski–Mann iteration for hierarchical fixed-point problems
- Iterative selection methods for common fixed point problems
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
- Convergence analysis of modified hybrid steepest-descent methods with variable parameters for variational inequalities
Cited In (14)
- Relaxed iterative algorithms for generalized mixed equilibrium problems with constraints of variational inequalities and variational inclusions
- Regularized hybrid iterative algorithms for triple hierarchical variational inequalities
- Composite relaxed extragradient method for triple hierarchical variational inequalities with constraints of systems of variational inequalities
- Hybrid steepest-descent viscosity methods for triple hierarchical variational inequalities with constraints of mixed equilibria and bilevel variational inequalities
- Iterative methods for triple hierarchical variational inequalities and common fixed point problems
- 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
- Iterative methods for triple hierarchical variational inequalities with mixed equilibrium problems, variational inclusions, and variational inequalities constraints
- Efficient implementation of a modified and relaxed hybrid steepest-descent method for a type of variational inequality
- Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization
- Hybrid steepest-descent methods for triple hierarchical 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
- On general implicit hybrid iteration method for triple hierarchical variational inequalities with hierarchical variational inequality constraints
This page was built for publication: Relaxed hybrid steepest-descent methods with variable parameters for triple-hierarchical variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143358)
