Recent results on Douglas-Rachford methods for combinatorial optimization problems
From MaRDI portal
Abstract: We discuss recent positive experiences applying convex feasibility algorithms of Douglas--Rachford type to highly combinatorial and far from convex problems.
Cites work
- scientific article; zbMATH DE number 4158856 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- A Lyusternik-Graves theorem for the proximal point method
- A cyclic Douglas-Rachford iteration scheme
- Alternating projections in CAT(0) spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex functions. Constructions, characterizations and counterexamples
- Convex optimization techniques for the efficient recovery of a sparsely corrupted low-rank matrix
- Douglas-Rachford feasibility methods for matrix completion problems
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Global convergence of a non-convex Douglas-Rachford iteration
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On weak convergence of the Douglas-Rachford method
- Projection and proximal point methods: Convergence results and counterexamples.
- Removing multiplicative noise by Douglas-Rachford splitting methods
- Restricted normal cones and sparsity optimization with affine constraints
- Searching with iterated maps
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Techniques of variational analysis
- Tetravex is NP-complete
- The Douglas-Rachford algorithm in the absence of convexity
- The cyclic Douglas-Rachford method for inconsistent feasibility problems
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(40)- Application of projection algorithms to differential equations: boundary value problems
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Projection methods for quantum channel construction
- A product space reformulation with reduced dimension for splitting algorithms
- Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres
- Convergence rate analysis for averaged fixed point iterations in common fixed point problems
- New Douglas-Rachford algorithmic structures and their convergence analyses
- Non-separable multidimensional multiresolution wavelets: a Douglas-Rachford approach
- Comparing averaged relaxed cutters and projection methods: theory and examples
- On the order of the operators in the Douglas-Rachford algorithm
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Circumcentering reflection methods for nonconvex feasibility problems
- Circumcentering the Douglas-Rachford method
- Solving graph coloring problems with the Douglas-Rachford algorithm
- A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization
- A Lyapunov function construction for a non-convex Douglas-Rachford iteration
- General splitting methods with linearization for the split feasibility problem
- The Douglas-Rachford algorithm for the case of the sphere and the line
- On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
- A new projection method for finding the closest point in the intersection of convex sets
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
- On the Douglas-Rachford algorithm
- Norm convergence of realistic projection and reflection methods
- On the linear convergence of the circumcentered-reflection method
- Matrix product constraints by projection methods
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- Iteration process for fixed point problems and zeros of maximal monotone operators
- A cyclic Douglas-Rachford iteration scheme
- Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
- A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance
- A feasibility approach for constructing combinatorial designs of circulant type
- The block-wise circumcentered-reflection method
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- Convergence analysis of processes with valiant projection operators in Hilbert space
- Solving nonconvex feasibility problem on a sphere and a closed ball by Douglas-Rachford algorithm
- Constraint reduction reformulations for projection algorithms with applications to wavelet construction
- The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
This page was built for publication: Recent results on Douglas-Rachford methods for combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q467464)
