Approximating Fixed Points of Nonexpansive Type Mappings via General Picard-Mann Algorithm.
Rahul ShuklaRekha PanickerPublished in: Comput. (2022)
Keyphrases
- fixed point
- dynamic programming
- neural network
- k means
- worst case
- image segmentation
- asymptotic properties
- objective function
- sufficient conditions
- dynamical systems
- expectation maximization
- approximate value iteration
- temporal difference learning
- bayesian framework
- data clustering
- matching algorithm
- depth map
- search space
- optimal solution
- bayesian networks
- learning algorithm