Iterative algorithm for solving triple-hierarchical constrained optimization problem
From MaRDI portal
Publication:535086
DOI10.1007/s10957-010-9769-zzbMath1216.90092OpenAlexW2021902942MaRDI QIDQ535086
Publication date: 11 May 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9769-z
strong convergencefixed pointvariational inequalitynonexpansive mappingmonotone operatorhierarchical constrained optimization problem
Related Items
Approximate solutions to variational inequality over the fixed point set of a strongly nonexpansive mapping ⋮ Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping ⋮ Iterative methods for triple hierarchical variational inequalities and common fixed point problems ⋮ Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping ⋮ Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings ⋮ Multistep hybrid viscosity method for split monotone variational inclusion and fixed point problems in Hilbert spaces ⋮ Weak convergence of a Mann-like algorithm for nonexpansive and accretive operators ⋮ Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization ⋮ Hybrid steepest descent viscosity method for triple hierarchical variational inequalities ⋮ Multi-step hybrid viscosity method for systems of variational inequalities defined over sets of solutions of an equilibrium problem and fixed point problems ⋮ The hybrid steepest descent method for solving variational inequality over triple hierarchical problems ⋮ Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization ⋮ A Sequential Constraint Method for Solving Variational Inequality over the Intersection of Fixed Point Sets ⋮ Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem ⋮ On general implicit hybrid iteration method for triple hierarchical variational inequalities with hierarchical variational inequality constraints ⋮ Implicit iterative method for hierarchical variational inequalities ⋮ Algorithms for solving the variational inequality problem over the triple hierarchical problem ⋮ Two stochastic optimization algorithms for convex optimization with fixed point constraints ⋮ Hybrid steepest-descent methods for triple hierarchical variational inequalities ⋮ Strong convergence of an iterative algorithm for hierarchical problems ⋮ Composite relaxed extragradient method for triple hierarchical variational inequalities with constraints of systems of variational inequalities ⋮ Hybrid implicit steepest-descent methods for triple hierarchical variational inequalities with hierarchical variational inequality constraints ⋮ 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 in Hilbert spaces ⋮ Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping ⋮ Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization ⋮ Optimization for Inconsistent Split Feasibility Problems ⋮ Decentralized hierarchical constrained convex optimization ⋮ Incremental subgradient method for nonsmooth convex optimization with fixed point constraints ⋮ Synchronal algorithm and cyclic algorithm for hierarchical fixed point problems and variational inequalities ⋮ Triple hierarchical variational inequalities with constraints of mixed equilibria, variational inequalities, convex minimization, and hierarchical fixed point problems ⋮ Triple-hierarchical problems with variational inequality ⋮ Composite steepest-descent method for the triple hierarchical variational inequalities ⋮ Unnamed Item ⋮ Relaxed hybrid steepest-descent methods with variable parameters for triple-hierarchical variational inequalities ⋮ Multi-step iterative algorithms with regularization for triple hierarchical variational inequalities with constraints of mixed equilibria, variational inclusions, and convex minimization ⋮ Regularized hybrid iterative algorithms for triple hierarchical variational inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- Iterative selection methods for common fixed point problems
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- Ill-posed problems with a priori information
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Construction of fixed points of nonlinear mappings in Hilbert space
- 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
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- An Introduction to Variational Inequalities and Their Applications
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- On Projection Algorithms for Solving Convex Feasibility Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Krasnoselski–Mann iteration for hierarchical fixed-point problems
