On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections.
Heinz H. BauschkeRegina Sandra BurachikDaniel B. HermanC. Yalçin KayaPublished in: CoRR (2020)
Keyphrases
- iterative algorithms
- dynamic programming
- detection algorithm
- high accuracy
- cost function
- experimental evaluation
- convergence rate
- clustering method
- preprocessing
- improved algorithm
- k means
- detection method
- objective function
- rapid convergence
- theoretical analysis
- segmentation algorithm
- computational cost
- energy function
- synthetic and real images
- computational complexity
- significant improvement
- selection algorithm
- optimization algorithm
- single pass
- convergence property
- segmentation method
- optimization method
- high efficiency
- recognition algorithm
- computationally efficient
- tree structure
- reconstruction method
- initial guess
- faster convergence
- estimation algorithm
- classification method
- matching algorithm
- similarity measure
- computational efficiency
- input data
- probabilistic model
- region of interest
- support vector machine svm
- expectation maximization
- simulated annealing
- image segmentation
- learning algorithm
- neural network
- gauss seidel method
- convex optimization
- image reconstruction
- em algorithm
- genetic algorithm