Fetching the paper…
Reading the bibliography…
We study constrained stochastic programs where the decision vector at each time slot cannot be chosen freely but is tied to the realization of an underlying random state vector.
Agrawal, R
2002
Earlier work this paper cites.
[author] Kushner, H.H. and Whiting, P.P. (Oct. 2002). Asymptotic Properties of Proportional-Fair Sharing Algorithms. Proc. 40th Annual Allerton Conf. on Communication, Control, and Computing, Monticello, IL
2002
Earlier work this paper cites.
Andrews, M
2005
Earlier work this paper cites.
[author] Lee, J-WJ.-W., Mazumdar, Ravi RR. R. and Shroff, Ness BN. B. (2005). Non-convex optimization and rate control for multi-class services in the Internet. IEEE/ACM transactions on networking 13 827–840
2005
Earlier work this paper cites.
[author] Stolyar, Alexander LA. L. (2005). On the asymptotic optimality of the gradient scheduling algorithm for multiuser throughput allocation. Operations research 53 12–25
2005
Earlier work this paper cites.
[author] Stolyar, Alexander LA. L. (2005). Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. Queueing Systems 50 401–457
2005
Earlier work this paper cites.
[author] Lee, J-WJ.-W., Mazumdar, Ravi RR. R. and Shroff, Ness BN. B. (2006). Opportunistic power scheduling for dynamic multi-server wireless systems. IEEE Transactions on Wireless Communications 5 1506–1515
2006
Earlier work this paper cites.
[author] Eryilmaz, AtillaA. and Srikant, RR. (2007). Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control. IEEE/ACM Transactions on Networking (TON) 15 1333–1344
2007
Earlier work this paper cites.
[author] Neely, Michael JM. J., Modiano, EytanE. and Li, Chih-PingC.-P. (2008). Fairness and optimal stochastic control for heterogeneous networks. IEEE/ACM Transactions On Networking 16 396–409
2008
Cited alongside, same era.
[author] Chiang, MungM. (2009). Nonconvex optimization for communication networks. In Advances in Applied Mathematics and Global Optimization 137–196. Springer
2009
Cited alongside, same era.
[author] Neely, Michael JM. J. (2010). Stochastic network optimization with application to communication and queueing systems. Synthesis Lectures on Communication Networks 3 1–211
2010
Cited alongside, same era.
Neely, M. J
2010
Cited alongside, same era.
Jaggi, M
2013
Cited alongside, same era.
2015
Later among the works it cites.
2015
Later among the works it cites.
2016
Later among the works it cites.
[author] Li, GuoyinG. and Pong, Ting KeiT. K. (2016). Douglas–Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Mathematical programming 159 371–401
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
[author] Bubeck, SébastienS. et al. (2015). Convex optimization: Algorithms and complexity. Foundations and Trends® in Machine Learning 8 231–357
2015
Cited alongside, same era.
[author] Nesterov, YuY. (2015). Complexity bounds for primal-dual methods minimizing the model of objective function. Mathematical Programming 1–20
2015
Cited alongside, same era.
2016
Later among the works it cites.
Neely, M. J
2017
Later among the works it cites.
[author] Yang, LeiL., Pong, Ting KeiT. K. and Chen, XiaojunX. (2017). Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction. SIAM Journal on Imaging Sciences 10 74–110
2017
Later among the works it cites.