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

DOI10.1109/TAC.2013.2253223MaRDI QIDQ5353322zbMATH OpenOpenAlexFDO

Authors Ermin Wei, Asuman Ozdaglar, Ali Jadbabaie

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

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

Cited in

(7)

• Distributed approximate Newton algorithms and weight design for constrained optimization
• Distributed Newton methods for strictly convex consensus optimization problems in multi-agent networks
• Random block coordinate descent methods for linearly constrained optimization over networks
• Complexity certifications of first-order inexact Lagrangian methods for general convex programming: application to real-time MPC
• A rolling penalty function algorithm of real-time pricing for smart microgrids based on bilevel programming
• Path-based incremental target level algorithm on Riemannian manifolds
• A Distributed Newton Method for Network Utility Maximization–I: Algorithm

This page was built for publication: A Distributed Newton Method for Network Utility Maximization—Part II: Convergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353322)