Before revision:  We formulate a cache optimization problem to maximize the sum of utilities over all contents under stationary and ergodic request process, which is non-convex in general .
After revision:  We formulate a cache optimization problem to maximize the sum of utilities over all contents under stationary and ergodic request processes. This problem is non-convex in general .