Sign Up to like & get
recommendations!
1
Published in 2018 at "Optimization"
DOI: 10.1080/02331934.2018.1474355
Abstract: Abstract For an arbitrary family of closed convex sets with nonempty intersection in a Hilbert space, we consider the classical convex feasibility problem. We study the convergence property of the recently introduced unified projection algorithm…
read more here.
Keywords:
problem image;
convex feasibility;
image recovery;
inverse problem ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2022 at "Optimization Methods and Software"
DOI: 10.1080/10556788.2021.1998492
Abstract: The stochastic alternating projection (SP) algorithm is a simple but powerful approach for solving convex feasibility problems. At each step, the method projects the current iterate onto a random individual set from the intersection. Hence,…
read more here.
Keywords:
projection;
convex feasibility;
extrapolation;
feasibility ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2017 at "Inverse Problems"
DOI: 10.1088/1361-6420/aa5d79
Abstract: The convex feasibility problem is to find a common point of a finite family of closed convex subsets. In many applications one requires something more, namely finding a common point of closed convex subsets which…
read more here.
Keywords:
level control;
superiorization;
methodology;
convex feasibility ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2018 at "Mathematics"
DOI: 10.3390/math6110249
Abstract: In this paper, we propose a new method, which is called the combination projection method (CPM), for solving the convex feasibility problem (CFP) of finding some x * ∈ C : = ∩ i =…
read more here.
Keywords:
convex feasibility;
method;
combination projection;
projection ... See more keywords