A new accelerated algorithm for solving variational inequalities over the solution of multiple set split common fixed point problem
DOI10.1007/S12215-024-01033-3zbMATH Open1546.49018MaRDI QIDQ6597484
Publication date: 3 September 2024
Published in: Rendiconti del Circolo Matematico di Palermo (Search for Journal in Brave)
variational inequalitysplit common fixed pointgeneralized demimetric mappingsthe steepest descent algorithm
Convex programming (90C25) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
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?)
- Solving the variational inequality problem defined on intersection of finite level sets
- A simpler explicit iterative algorithm for a class of variational inequalities in Hilbert spaces
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- Iterative methods for fixed point problems in Hilbert spaces
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Convergence of hybrid steepest-descent methods for variational inequalities
- Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
- Two projection algorithms for solving the split common fixed point problem
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Variational inequality over the set of common solutions of a system of bilevel variational inequality problem with applications
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- The multiple-sets split feasibility problem and its applications for inverse problems
- The split common fixed-point problem for demicontractive mappings
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Numerical Optimization
- Weak and Strong Convergence Theorems for New Demimetric Mappings and the Split Common Fixed Point Problem in Banach Spaces
- Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation
- Approximation of solutions of the split minimization problem with multiple output sets and common fixed point problems in real Banach spaces
- Strong convergence theorem for common zero points of inverse strongly monotone mappings and common fixed points of generalized demimetric mappings
- Parallel Iterative Methods for Solving the Split Common Fixed Point Problem in Hilbert Spaces
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Some descent three-term conjugate gradient methods and their global convergence
- Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning
- Split common fixed point problem for demimetric mappings and Bregman relatively nonexpansive mappings
- A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints
Related Items (1)
This page was built for publication: A new accelerated algorithm for solving variational inequalities over the solution of multiple set split common fixed point problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6597484)
