Results

**1 - 1**of**1**### Time-Average Stochastic Optimization with Non-convex Decision Set and its Convergence

"... Abstract-This paper considers time-average stochastic optimization, where a time average decision vector, an average of decision vectors chosen in every time step from a timevarying (possibly non-convex) set, minimizes a convex objective function and satisfies convex constraints. This formulation h ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract-This paper considers time-average stochastic optimization, where a time average decision vector, an average of decision vectors chosen in every time step from a timevarying (possibly non-convex) set, minimizes a convex objective function and satisfies convex constraints. This formulation has applications in networking and operations research. In general, time-average stochastic optimization can be solved by a Lyapunov optimization technique. This paper shows that the technique exhibits a transient phase and a steady state phase. When the problem has a unique vector of Lagrange multipliers, the convergence time can be improved. By starting the time average in the steady state, the convergence times become O(1/ ) under a locally-polyhedral assumption and O(1/ 1.5 ) under a locallynon-polyhedral assumption, where denotes the proximity to the optimal objective cost.