An explicit method for the split feasibility problem with self-adaptive step sizes (Q1938197): Difference between revisions

Summary: An explicit iterative method with self-adaptive step-sizes for solving the split feasibility problem is presented. A strong convergence theorem is provided.

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1155/2012/432501

0 references

cites work

A multiprojection algorithm using Bregman projections in a product space

0 references

Iterative oblique projection onto convex sets and the split feasibility problem

0 references

The multiple-sets split feasibility problem and its applications for inverse problems

0 references

The strong convergence of a KM–CQ-like algorithm for a split feasibility problem

0 references

A note on the <i>CQ</i> algorithm for the split feasibility problem

0 references

Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem

0 references

Cyclic algorithms for split feasibility problems in Hilbert spaces

0 references

The relaxed inexact projection methods for the split feasibility problem

0 references

Solving the split feasibility problem without prior knowledge of matrix norms

0 references

A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem

0 references

Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces

0 references

Several solution methods for the split feasibility problem

0 references

A self-adaptive projection method for solving the multiple-sets split feasibility problem

0 references

Self-adaptive projection methods for the multiple-sets split feasibility problem

0 references

An extragradient method for solving split feasibility and fixed point problems

0 references

A perturbed projection algorithm with inertial technique for split feasibility problem

0 references

An extrapolated iterative algorithm for multiple-set split feasibility problem

0 references

Inexact operator splitting methods with selfadaptive strategy for variational inequality problems

0 references

A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems

0 references

Self-adaptive projection method for co-coercive variational inequalities

0 references

A self-adaptive projection and contraction method for monotone symmetric linear variational inequalities.

0 references

On variable-step relaxed projection algorithm for variational inequalities

0 references

Iterative Algorithms for Nonlinear Operators

0 references

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

0 references

Identifiers

zbMATH Open document ID

1256.65047

0 references

DOI

10.1155/2012/432501

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1938197

@@ Property / cites work @@
+A multiprojection algorithm using Bregman projections in a product space
+Normal rank
@@ Property / cites work @@
+Iterative oblique projection onto convex sets and the split feasibility problem
+Normal rank
@@ Property / cites work @@
+The multiple-sets split feasibility problem and its applications for inverse problems
+Normal rank
@@ Property / cites work @@
+The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
+Normal rank
@@ Property / cites work @@
+A note on the                     <i>CQ</i>                     algorithm for the split feasibility problem
+Normal rank
@@ Property / cites work @@
+Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
+Normal rank
@@ Property / cites work @@
+Cyclic algorithms for split feasibility problems in Hilbert spaces
+Normal rank
@@ Property / cites work @@
+The relaxed inexact projection methods for the split feasibility problem
+Normal rank
@@ Property / cites work @@
+Solving the split feasibility problem without prior knowledge of matrix norms
+Normal rank
@@ Property / cites work @@
+A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
+Normal rank
@@ Property / cites work @@
+Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
+Normal rank
@@ Property / cites work @@
+Several solution methods for the split feasibility problem
+Normal rank
@@ Property / cites work @@
+A self-adaptive projection method for solving the multiple-sets split feasibility problem
+Normal rank
@@ Property / cites work @@
+Self-adaptive projection methods for the multiple-sets split feasibility problem
+Normal rank
@@ Property / cites work @@
+An extragradient method for solving split feasibility and fixed point problems
+Normal rank
@@ Property / cites work @@
+A perturbed projection algorithm with inertial technique for split feasibility problem
+Normal rank
@@ Property / cites work @@
+An extrapolated iterative algorithm for multiple-set split feasibility problem
+Normal rank
@@ Property / cites work @@
+Inexact operator splitting methods with selfadaptive strategy for variational inequality problems
+Normal rank
@@ Property / cites work @@
+A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
+Normal rank
@@ Property / cites work @@
+Self-adaptive projection method for co-coercive variational inequalities
+Normal rank
@@ Property / cites work @@
+A self-adaptive projection and contraction method for monotone symmetric linear variational inequalities.
+Normal rank
@@ Property / cites work @@
+On variable-step relaxed projection algorithm for variational inequalities
+Normal rank
@@ Property / cites work @@
+Iterative Algorithms for Nonlinear Operators
@@ Property / cites work: Iterative Algorithms for Nonlinear Operators / rank @@
+Normal rank
@@ Property / cites work @@
+Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
+Normal rank