A regularized algorithm for the proximal split feasibility problem (Q1725206): Difference between revisions

Summary: The proximal split feasibility problem has been studied. A regularized method has been presented for solving the proximal split feasibility problem. Strong convergence theorem is given.

0 references

zbMATH Keywords

proximal split feasibility problem

0 references

regularized method

0 references

strong convergence

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1155/2014/894272

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

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

0 references

A unified treatment of some iterative algorithms in signal processing and image reconstruction

0 references

Several solution methods for the split feasibility problem

0 references

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

0 references

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

0 references

Regularized methods for the split feasibility problem

0 references

Solving proximal split feasibility problems without prior knowledge of operator norms

0 references

Iterative Algorithms for Nonlinear Operators

0 references

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

0 references

Split monotone variational inclusions

0 references

The Split Common Null Point Problem

0 references

An explicit method for the split feasibility problem with self-adaptive step sizes

0 references

Identifiers

zbMATH Open document ID

1473.47047

0 references

DOI

10.1155/2014/894272

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1725206

@@ 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 @@
+Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
+Normal rank
@@ Property / cites work @@
+A unified treatment of some iterative algorithms in signal processing and image reconstruction
+Normal rank
@@ Property / cites work @@
+Several solution methods for the split feasibility problem
+Normal rank
@@ Property / cites work @@
+The strong convergence of a KM–CQ-like algorithm for a 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 @@
+Regularized methods for the split feasibility problem
+Normal rank
@@ Property / cites work @@
+Solving proximal split feasibility problems without prior knowledge of operator norms
+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
@@ Property / cites work @@
+Split monotone variational inclusions
@@ Property / cites work: Split monotone variational inclusions / rank @@
+Normal rank
@@ Property / cites work @@
+The Split Common Null Point Problem
@@ Property / cites work: The Split Common Null Point Problem / rank @@
+Normal rank
@@ Property / cites work @@
+An explicit method for the split feasibility problem with self-adaptive step sizes
+Normal rank