Iterative algorithm for solving triple-hierarchical constrained optimization problem
From MaRDI portal
Publication:535086
Recommendations
- A unified implicit algorithm for solving the triple-hierarchical constrained optimization problem
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
- Steepest-descent approach to triple hierarchical constrained optimization problems
- Algorithms for solving the variational inequality problem over the triple hierarchical problem
- Iterative methods for triple hierarchical variational inequalities and common fixed point problems
- Iterative algorithm for triple-hierarchical constrained nonconvex optimization problem and its application to network bandwidth allocation
- An iterative algorithm for a hierarchical problem
- Regularized hybrid iterative algorithms for triple hierarchical variational inequalities
- Multi-step hybrid iterative method for triple hierarchical variational inequality problem with equilibrium problem constraint
- Iterative methods for triple hierarchical variational inequalities with mixed equilibrium problems, variational inclusions, and variational inequalities constraints
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
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- Ill-posed problems with a priori information
- Iterative selection methods for common fixed point problems
- Krasnoselski–Mann iteration for hierarchical fixed-point problems
- 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 hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
Cited in
(39)- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
- Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
- 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
- Triple-hierarchical problems with variational inequality
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- 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
- Triple hierarchical variational inequalities with constraints of mixed equilibria, variational inequalities, convex minimization, and hierarchical fixed point problems
- 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 algorithm for triple-hierarchical constrained nonconvex optimization problem and its application to network bandwidth allocation
- Synchronal algorithm and cyclic algorithm for hierarchical fixed point problems and variational inequalities
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Strong convergence of an iterative algorithm for hierarchical problems
- Hybrid steepest-descent methods for triple hierarchical variational inequalities
- scientific article; zbMATH DE number 6872019 (Why is no real title available?)
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
- Implicit iterative method for hierarchical variational inequalities
- Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization
- On general implicit hybrid iteration method for triple hierarchical variational inequalities with hierarchical variational inequality constraints
- A sequential constraint method for solving variational inequality over the intersection of fixed point sets
- Two stochastic optimization algorithms for convex optimization with fixed point constraints
- A new accelerated algorithm for solving variational inequalities over the solution of multiple set split common fixed point problem
- Weak convergence of a Mann-like algorithm for nonexpansive and accretive operators
- Optimization for Inconsistent Split Feasibility Problems
- Multistep hybrid viscosity method for split monotone variational inclusion and fixed point problems in Hilbert spaces
- Relaxed hybrid steepest-descent methods with variable parameters 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
- Iterative methods for triple hierarchical variational inequalities in Hilbert spaces
- Multi-step iterative algorithms with regularization for triple hierarchical variational inequalities with constraints of mixed equilibria, variational inclusions, and convex minimization
- Algorithms for solving the variational inequality problem over the triple hierarchical problem
- Regularized hybrid iterative algorithms for triple hierarchical variational inequalities
- Decentralized hierarchical constrained convex optimization
- Hybrid steepest descent viscosity method for triple hierarchical variational inequalities
- The hybrid steepest descent method for solving variational inequality over triple hierarchical problems
This page was built for publication: Iterative algorithm for solving triple-hierarchical constrained optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535086)
