The method of alternating relaxed projections for two nonconvex sets (Q484479)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The method of alternating relaxed projections for two nonconvex sets |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The method of alternating relaxed projections for two nonconvex sets |
scientific article |
Statements
The method of alternating relaxed projections for two nonconvex sets (English)
0 references
7 January 2015
0 references
The method of alternating projections as a classical algorithm for solving feasibility problems has been intensily studied for nonconvex sets. However, intrinsically available are only local convergence results. To improve this situation, the authors study the method of alternating relaxed projections, where the unrelaxed projection steps are replaced by underrelaxed versions, and establish local linear convergence results. Several examples are given.
0 references
feasibility problem
0 references
linear convergence
0 references
method of alternating projections
0 references
method of alternating relaxed projections
0 references
normal cone
0 references
projection operator
0 references
numerical examples
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8628489375114441
0 references
0.8236915469169617
0 references
0.8109075427055359
0 references
0.8072595000267029
0 references
