A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints (Q6157447): Difference between revisions

Latest revision as of 18:59, 30 December 2024

scientific article; zbMATH DE number 7684721

Language	Label	Description	Also known as
English	A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints	scientific article; zbMATH DE number 7684721

Statements

instance of

scholarly article

0 references

title

A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints (English)

0 references

0 references

0 references

0 references

0 references

0 references

11 May 2023

0 references

zbMATH Keywords

variational inequality

0 references

fixed-point set

0 references

firmly nonexpansive operator

0 references

conjugate gradient method

0 references

machine learning

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11075-022-01430-8

0 references

cites work

Q4091727

0 references

Linear convergence rates for extrapolated fixed point algorithms

0 references

On Projection Algorithms for Solving Convex Feasibility Problems

0 references

On the behavior of a block-iterative projection method for solving convex feasibility problems

0 references

Iterative methods for fixed point problems in Hilbert spaces

0 references

Q5410420

0 references

Opial-Type Theorems and the Common Fixed Point Problem

0 references

Extrapolation and local acceleration of an iterative process for common fixed point problems

0 references

An Algorithm for Solving the Variational Inequality Problem Over the Fixed Point Set of a Quasi-Nonexpansive Operator in Euclidean Space

0 references

Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators

0 references

New methods for linear inequalities

0 references

A Two-Term PRP-Based Descent Method

0 references

Q5769827

0 references

A parallel subgradient projections method for the convex feasibility problem

0 references

Iterative methods for solving variational inequalities in Euclidean space

0 references

Outer approximation methods for solving variational inequalities in Hilbert space

0 references

Convex programming in Hilbert space

0 references

Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping

0 references

Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions

0 references

An ergodic algorithm for the power-control games for CDMA data networks

0 references

A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping

0 references

Block-iterative surrogate projection methods for convex feasibility problems

0 references

Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization

0 references

Weak convergence of the sequence of successive approximations for nonexpansive mappings

0 references

Decomposition through formalization in a product space

0 references

A Sequential Constraint Method for Solving Variational Inequality over the Intersection of Fixed Point Sets

0 references

Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets

0 references

Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method

0 references

Robust Wideband Beamforming by the Hybrid Steepest Descent Method

0 references

Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings

0 references

Cyclic algorithms for split feasibility problems in Hilbert spaces

0 references

Iterative Algorithms for Nonlinear Operators

0 references

The Landweber Operator Approach to the Split Equality Problem

0 references

Q2768033

0 references

Q4409551

0 references

A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence

0 references

Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search

0 references

Some descent three-term conjugate gradient methods and their global convergence

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S11075-022-01430-8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6157447

@@ Property / DOI @@
-.1007/s11075-022-01430-8
@@ Property / DOI: 10.1007/s11075-022-01430-8 / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S11075-022-01430-8
@@ Property / DOI: 10.1007/S11075-022-01430-8 / rank @@
+Normal rank