Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization
From MaRDI portal
(Redirected from Publication:367393)
Recommendations
- Strong convergence of three-step relaxed hybrid steepest-descent methods for variational inequalities
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
- Relaxed hybrid steepest-descent methods with variable parameters for triple-hierarchical variational inequalities
- Strong convergence theorems of relaxed hybrid steepest-descent methods for variational in\-equalities
- Hybrid steepest-descent methods for triple hierarchical variational inequalities
- Hybrid steepest-descent methods for triple hierarchical variational inequalities
- The hybrid steepest descent method for solving variational inequality over triple hierarchical problems
- Hybrid implicit steepest-descent methods for triple hierarchical variational inequalities with hierarchical variational inequality constraints
- Steepest-descent approach to triple hierarchical constrained optimization problems
- A relaxed hybrid steepest descent method for solving strongly convex minimization problem via conjugate gradient direction
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3853749 (Why is no real title available?)
- scientific article; zbMATH DE number 3933858 (Why is no real title available?)
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- scientific article; zbMATH DE number 1145160 (Why is no real title available?)
- scientific article; zbMATH DE number 1376935 (Why is no real title available?)
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- 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
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- An Introduction to Variational Inequalities and Their Applications
- Construction of fixed points of nonlinear mappings in Hilbert space
- Convergence analysis of modified hybrid steepest-descent methods with variable parameters for variational inequalities
- Convergence of hybrid steepest-descent methods for variational inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Ill-posed problems with a priori information
- Iterative Algorithms for Nonlinear Operators
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Iterative methods for triple hierarchical variational inequalities in Hilbert spaces
- Iterative selection methods for common fixed point problems
- Krasnoselski–Mann iteration for hierarchical fixed-point problems
- Mathematical Programs with Equilibrium Constraints
- Nonlinear functional analysis. Fixed point theory and its applications
- On Projection Algorithms for Solving Convex Feasibility Problems
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
- Strong convergence of an iterative method for hierarchical fixed-point problems
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
Cited in
(10)- On general implicit hybrid iteration method for triple hierarchical variational inequalities with hierarchical variational inequality constraints
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
- 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
- Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
- 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
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)
