A Distributed Newton Method for Network Utility Maximization—Part II: Convergence

DOI10.1109/TAC.2013.2253223zbMath1369.90195OpenAlexW2089162893MaRDI QIDQ5353322

Ali Jadbabaie, Ermin Wei, Asuman Ozdaglar

Publication date: 8 September 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2013.2253223

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Methods of quasi-Newton type (90C53) Deterministic network models in operations research (90B10)

Related Items

A rolling penalty function algorithm of real-time pricing for smart microgrids based on bilevel programming ⋮ Random block coordinate descent methods for linearly constrained optimization over networks ⋮ Distributed approximate Newton algorithms and weight design for constrained optimization ⋮ Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC ⋮ Path-based incremental target level algorithm on Riemannian manifolds