A parallel projection method based on sequential most remote set in convex feasibility problems (Q1907078): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0096-3003(94)00177-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065839865 / rank | |||
Normal rank | |||
Revision as of 22:09, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel projection method based on sequential most remote set in convex feasibility problems |
scientific article |
Statements
A parallel projection method based on sequential most remote set in convex feasibility problems (English)
0 references
30 June 1996
0 references
The parallel projection method with variable weights to find a common point of a finite number of closed convex sets in the Hilbert space is equivalent to an iteration sequence formed by a sequential projection method in another Hilbert space, involving a corresponding sequence, a closed linear subspace and infinite number of suitable closed convex sets, where each set is determined by the choice of the weights of the initial projection procedure to find a common point, and leads to determination of those weights by solving a certain linear programming problem.
0 references
most remote set
0 references
convex feasibility problems
0 references
common point of sets
0 references
parallel projection method
0 references
closed convex sets
0 references
Hilbert space
0 references
sequential projection method
0 references
linear programming
0 references
