The Combination Projection Method for Solving Convex Feasibility Problems
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 <inline-formula> <math display="inline"> <semantics> <mrow> <msup> <mi>x</mi> <mo&g...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-11-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/6/11/249 |