Max-Weight Revisited: Sequences of Nonconvex Optimizations Solving Convex Optimizations

  title={Max-Weight Revisited: Sequences of Nonconvex Optimizations Solving Convex Optimizations},
  author={V{\'i}ctor Valls and D. Leith},
  journal={IEEE/ACM Transactions on Networking},
  • Víctor Valls, D. Leith
  • Published 2016
  • Computer Science, Mathematics
  • IEEE/ACM Transactions on Networking
  • We investigate the connections between max-weight approaches and dual subgradient methods for convex optimization. We find that strong connections exist, and we establish a clean, unifying theoretical framework that includes both max-weight and dual subgradient approaches as special cases. Our analysis uses only elementary methods and is not asymptotic in nature. It also allows us to establish an explicit and direct connection between discrete queue occupancies and Lagrange multipliers. 

    Figures and Topics from this paper.

    A Convex Optimization Approach to Discrete Optimal Control
    • 7
    • PDF
    Descent With Approximate Multipliers is Enough: Generalising Max-Weight
    • 4
    • PDF
    Stochastic subgradient methods with approximate Lagrange multipliers
    • 2
    • PDF
    Subgradient methods with perturbations in network problems
    Distinguishability and Web traffic timing analysis
    Dynamic Scheduling for IoT Analytics at the Edge


    Publications referenced by this paper.
    Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
    • 493
    • Highly Influential
    • PDF
    Maximizing queueing network utility subje ct to stability: Greedy primal-dual algorithm,”Queueing Systems
    • 2005