Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization
DOI10.1186/1687-1812-2012-29zbMATH Open1272.49022OpenAlexW2133957161WikidataQ59290889 ScholiaQ59290889MaRDI QIDQ367393FDOQ367393
M. M. Wong, Lu-Chuan Zeng, Jen-Chih Yao
Publication date: 16 September 2013
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1687-1812-2012-29
nonexpansive mappingstrong convergencevariational inequalityfixed-pointmonotone operatorrelaxed hybrid steepest-descent methodtriple-hierarchical constrained optimization
Numerical mathematical programming methods (65K05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Variational inequalities (49J40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Projection Algorithms for Solving Convex Feasibility Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Construction of fixed points of nonlinear mappings in Hilbert space
- Nonlinear functional analysis. Fixed point theory and its applications
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- An Introduction to Variational Inequalities and Their Applications
- Mathematical Programs with Equilibrium Constraints
- Convergence of hybrid steepest-descent methods for variational inequalities
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- 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
- 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 methods for triple hierarchical variational inequalities in Hilbert spaces
- 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
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping
- Ill-posed problems with a priori information
- 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 (8)
- Hybrid steepest-descent methods 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
- Composite steepest-descent method for the triple hierarchical variational inequalities
- Hybrid iterative scheme for triple hierarchical variational inequalities with mixed equilibrium, variational inclusion, and minimization constraints
- Hybrid implicit steepest-descent methods for triple hierarchical variational inequalities with hierarchical variational inequality constraints
- 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
Recommendations
- Relaxed hybrid steepest-descent methods with variable parameters for triple-hierarchical variational inequalities 👍 👎
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem 👍 👎
- Hybrid steepest-descent methods for triple hierarchical variational inequalities 👍 👎
- The hybrid steepest descent method for solving variational inequality over triple hierarchical problems 👍 👎
- Steepest-descent approach to triple hierarchical constrained optimization problems 👍 👎
- Strong convergence theorems of relaxed hybrid steepest-descent methods for variational in\-equalities 👍 👎
- Hybrid implicit steepest-descent methods for triple hierarchical variational inequalities with hierarchical variational inequality constraints 👍 👎
- Hybrid steepest-descent methods for triple hierarchical variational inequalities 👍 👎
- Strong convergence of three-step relaxed hybrid steepest-descent methods for variational inequalities 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367393)