Circumcentering reflection methods for nonconvex feasibility problems
From MaRDI portal
Publication:2158827
DOI10.1007/s11228-021-00626-9zbMath1492.90134arXiv1910.04384OpenAlexW2980043173MaRDI QIDQ2158827
Scott B. Lindstrom, Neil D. Dizon, Jeffrey A. Hogan
Publication date: 26 July 2022
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.04384
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Fixed-point theorems (47H10) Decomposition methods (49M27)
Related Items
Circumcentric directions of cones, Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions, On the centralization of the circumcentered-reflection method, A successive centralized circumcentered-reflection method for the convex feasibility problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
- The Douglas-Rachford algorithm for the case of the sphere and the line
- Circumcentering the Douglas-Rachford method
- Solving graph coloring problems with the Douglas-Rachford algorithm
- Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres
- A Lyapunov function construction for a non-convex Douglas-Rachford iteration
- On the linear convergence of circumcentered isometry methods
- The circumcentered-reflection method achieves better rates than alternating projections
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
- On the linear convergence of the circumcentered-reflection method
- The Douglas-Rachford algorithm for a hyperplane and a doubleton
- Global convergence of a non-convex Douglas-Rachford iteration
- On the circumcentered-reflection method for the convex feasibility problem
- The Douglas–Rachford Algorithm in the Absence of Convexity
- DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
- APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Decomposition through formalization in a product space
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
- The Complexity of Bit Retrieval
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- On circumcenters of finite sets in Hilbert spaces