To some extent, these might be regarded as borderline cases of feasibility which are arbitrarily excluded by CET (see, however, Section 4.6 below).
Internationally geoengineering tends to be framed pretty narrowly as just a case of technical feasibility, cost and efficacy.
A special case of the convex feasibility problem is the split feasibility problem, which is to find a point x ∗ such that x ∗ ∈ C and A x ∗ ∈ Q, (1.1).
A special case of the convex feasibility problem is the split feasibility problem given by: Let C, Q be nonempty closed convex subsets of Hilbert spaces H 1 and H 2, respectively, and let A : H 1 → H 2 be a bounded linear operator.
A special case of the split feasibility and fixed point problems is the split feasibility problem (SFP): mbox{Find } x^in C mbox{ such that } Ax^in Q. (1.2) We use (Gamma_{0}) to denote the set of solutions of (1.2), that is, Gamma_{0}=bigl{ x^: x^in C,Ax^in Qbigr}.
A special case of the split feasibility problem (1.1) is when Q = { b } is singleton and then (1.1) is reduced to the convexly constrained linear inverse problem [3] x ∗ ∈ C and A x ∗ = b, (1.2). which has received considerable attention.
Since the SFP is a special case of the convex feasibility problem (CFP), which is to find a point in the nonempty intersection of finitely many closed and convex sets, we next briefly review some historic approaches which relate to the CFP.
From the results in this section, we know that the split-equality problem is a special case of the split-feasibility problem.
In this case, the feasibility of this control can be validated on a quarter vehicle moving only in the vertical direction.
