Asymptotic properties of two time-scale stochastic approximation algorithms with constant step sizes.
Vladislav B. TadicSean P. MeynPublished in: ACC (2003)
Keyphrases
- approximation algorithms
- asymptotic properties
- step size
- approximation schemes
- np hard
- constant factor
- special case
- evolutionary programming
- worst case
- vertex cover
- fixed point
- convergence rate
- convergence speed
- minimum cost
- primal dual
- set cover
- cost function
- open shop
- randomized algorithms
- approximation ratio
- constant factor approximation
- optimal solution
- particle swarm optimization
- linear programming
- multi objective
- computational complexity