An alternative proof for convergence of stochastic approximation algorithms.
Sanjeev R. KulkarniC. HornPublished in: IEEE Trans. Autom. Control. (1996)
Keyphrases
- approximation algorithms
- approximation schemes
- np hard
- special case
- worst case
- stochastic approximation
- vertex cover
- minimum cost
- facility location problem
- primal dual
- set cover
- open shop
- np hardness
- convergence rate
- disjoint paths
- network design problem
- approximation ratio
- exact algorithms
- undirected graph
- constant factor approximation
- optimal solution
- polynomial time approximation
- constant factor
- precedence constraints
- combinatorial auctions
- lower bound