On the convergence time of the drift-plus-penalty algorithm for strongly convex programs.
Hao YuMichael J. NeelyPublished in: CDC (2015)
Keyphrases
- computational complexity
- detection algorithm
- convex programs
- probabilistic model
- objective function
- cost function
- optimal solution
- iterative algorithms
- simulated annealing
- convergence property
- search space
- dynamic programming
- data points
- higher dimensional
- convex hull
- linear programming
- worst case
- computer vision
- preprocessing
- image processing