Two algorithms for finding the projection of a point onto a nonconvex set in a normed space (Q2840267)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6188982
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two algorithms for finding the projection of a point onto a nonconvex set in a normed space |
scientific article; zbMATH DE number 6188982 |
Statements
17 July 2013
0 references
projection algorithm
0 references
convergence
0 references
Lipshitz condition
0 references
nonconvex surface
0 references
normed space
0 references
0.8846026
0 references
0.88408536
0 references
0.8826097
0 references
0.8772032
0 references
0.8757135
0 references
0.8733075
0 references
0 references
0.87206674
0 references
Two algorithms for finding the projection of a point onto a nonconvex set in a normed space (English)
0 references
Two iteration algorithms are proposed for finding the projection of a point onto a nonconvex set in a normed space, which is given by an equation \(f(x) = 0\). For the first case, the left-hand side of this equation is supposed to satisfy the subordination condition, which generalizes the Lipshitz condition. For the second case, the continuity of the function \(f\) is supposed and an approximate algorithm of projection is constructed.
0 references
