On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces.
Heinz H. BauschkeMinh Ngoc DaoDominikus NollHung M. PhanPublished in: J. Glob. Optim. (2016)
Keyphrases
- quadratic optimization problems
- iterative algorithms
- convergence rate
- euclidean space
- convex hull
- gauss seidel method
- neural network
- search space
- pattern recognition
- feature vectors
- higher dimensional
- image processing
- computer vision
- expectation maximization
- distance metric
- vector space
- shape analysis
- training set
- geodesic distance
- square root
- stochastic shortest path