A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints
From MaRDI portal
Publication:6157447
DOI10.1007/s11075-022-01430-8OpenAlexW4309114606MaRDI QIDQ6157447
Nimit Nimana, Narin Petrot, Mootta Prangprakhon, Porntip Promsinchai
Publication date: 11 May 2023
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-022-01430-8
variational inequalityconjugate gradient methodmachine learningfirmly nonexpansive operatorfixed-point set
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative methods for fixed point problems in Hilbert spaces
- Extrapolation and local acceleration of an iterative process for common fixed point problems
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
- An ergodic algorithm for the power-control games for CDMA data networks
- Iterative methods for solving variational inequalities in Euclidean space
- Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method
- Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- A parallel subgradient projections method for the convex feasibility problem
- New methods for linear inequalities
- Block-iterative surrogate projection methods for convex feasibility problems
- Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Opial-Type Theorems and the Common Fixed Point Problem
- Outer approximation methods for solving variational inequalities in Hilbert space
- Iterative Algorithms for Nonlinear Operators
- A Sequential Constraint Method for Solving Variational Inequality over the Intersection of Fixed Point Sets
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Decomposition through formalization in a product space
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- Linear convergence rates for extrapolated fixed point algorithms
- On Projection Algorithms for Solving Convex Feasibility Problems
- Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators
- Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions
- An Algorithm for Solving the Variational Inequality Problem Over the Fixed Point Set of a Quasi-Nonexpansive Operator in Euclidean Space
- Some descent three-term conjugate gradient methods and their global convergence
- A Two-Term PRP-Based Descent Method
- Convex programming in Hilbert space
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- The Landweber Operator Approach to the Split Equality Problem
