We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...