Almost sure convergence of extremum seeking algorithm using stochastic perturbation.
Miloje S. RadenkovicJae-Do ParkPublished in: Syst. Control. Lett. (2016)
Keyphrases
- improved algorithm
- experimental evaluation
- cost function
- objective function
- computational complexity
- theoretical analysis
- monte carlo
- detection algorithm
- optimization algorithm
- times faster
- learning algorithm
- computational cost
- classification algorithm
- segmentation algorithm
- computationally efficient
- convergence rate
- recognition algorithm
- high accuracy
- np hard
- iterative algorithms
- faster convergence
- search space
- stochastic approximation
- similarity measure
- convex hull
- particle swarm optimization
- convergence proof
- energy function
- expectation maximization
- maximum likelihood
- linear programming
- markov random field
- dynamic programming
- significant improvement
- k means
- optimal solution
- image segmentation