The Douglas-Rachford algorithm for convex and nonconvex feasibility problems.
Francisco J. Aragón ArtachoRubén CampoyMatthew K. TamPublished in: Math. Methods Oper. Res. (2020)
Keyphrases
- quadratic optimization problems
- benchmark problems
- optimal solution
- cost function
- convex optimization
- matching algorithm
- learning algorithm
- probabilistic model
- simulated annealing
- optimization problems
- similarity measure
- globally convergent
- convex relaxation
- globally optimal
- convex hull
- detection algorithm
- worst case
- dynamic programming
- np hard
- computational complexity
- objective function
- optimization algorithm
- combinatorial optimization
- linear programming
- convergence rate
- k means
- stationary points