Solving nonconvex feasibility problem on a sphere and a closed ball by Douglas-Rachford algorithm

DOI10.1142/S0217595920500426MaRDI QIDQ5012891zbMATH OpenOpenAlexFDO

Authors 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

nonconvexglobal convergenceprojectorfeasibility problemDouglas-Rachford algorithmreflector

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
• On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
• A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
• The Douglas-Rachford algorithm in the absence of convexity

Cites work

• Douglas-Rachford feasibility methods for matrix completion problems
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
• Global convergence of a non-convex Douglas-Rachford iteration
• On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
• Searching with iterated maps
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• The Douglas-Rachford algorithm for a hyperplane and a doubleton
• The Douglas-Rachford algorithm for the case of the sphere and the line
• The Douglas-Rachford algorithm in the absence of convexity

Cited in

(6)

• Convergence theorem for fixed point and split generalized variational inclusion problems with multiple output sets in Banach spaces
• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Application of projection algorithms to differential equations: boundary value problems
• Circumcentering reflection methods for nonconvex feasibility problems
• A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting

This page was built for publication: Solving nonconvex feasibility problem on a sphere and a closed ball by Douglas-Rachford algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012891)