Solving Nonconvex Feasibility Problem on a Sphere and a Closed Ball by Douglas–Rachford Algorithm

DOI10.1142/S0217595920500426zbMath1481.90265OpenAlexW3048655594MaRDI QIDQ5012891

Kumari Sweta Srivastava, Suvendu Ranjan Pattanaik

Publication date: 26 November 2021

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595920500426

zbMATH Keywords

global convergencenonconvexprojectorfeasibility problemDouglas-Rachford algorithmreflector

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• The Douglas-Rachford algorithm for the case of the sphere and the line
• The Douglas-Rachford algorithm for a hyperplane and a doubleton
• Global convergence of a non-convex Douglas-Rachford iteration
• The Douglas–Rachford Algorithm in the Absence of Convexity
• DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
• Searching with iterated maps
• On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces

This page was built for publication: Solving Nonconvex Feasibility Problem on a Sphere and a Closed Ball by Douglas–Rachford Algorithm