We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Solving Nonconvex Feasibility Problem on a Sphere and a Closed Ball by Douglas–Rachford Algorithm.
- Authors
Srivastava, Kumari Sweta; Pattanaik, S. R.
- Abstract
In recent times, a variety of nonconvex feasibility problems have been solved empirically by employing Douglas–Rachford (DR) splitting methods. However, this theory is not adequate in explaining the observed success and is more concerned with the local convergence. In this paper, we study the convergence of the DR splitting method for finding a point of intersection of a closed ball and a sphere in the n -dimensional Euclidean spaces. Also, we provide the region for the global convergence of the DR splitting method.
- Subjects
SPHERES; ALGORITHMS; SUCCESS
- Publication
Asia-Pacific Journal of Operational Research, 2021, Vol 38, Issue 1, pN.PAG
- ISSN
0217-5959
- Publication type
Article
- DOI
10.1142/S0217595920500426