A Distributed Newton Method for Network Utility Maximization–I: Algorithm

DOI10.1109/TAC.2013.2253218zbMath1369.90194MaRDI QIDQ5353321

Ali Jadbabaie, Ermin Wei, Asuman Ozdaglar

Publication date: 8 September 2017

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

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 primal‐dual active‐set method for distributed model predictive control, Constrained distributed optimization: a population dynamics approach, A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems, Distributed algorithm design for constrained resource allocation problems with high-order multi-agent systems, Mechanism design for demand management in energy communities, Distributed strategy for constrained resource allocation problems of autonomous second-order nonlinear agents and its application to smart grids, Distributed continuous‐time constrained convex optimization with general time‐varying cost functions, Decentralized nonconvex optimization with guaranteed privacy and accuracy, Two-stage continuous-time triggered algorithms for constrained distributed optimization over directed graphs, Gradient-tracking based differentially private distributed optimization with enhanced optimization accuracy, A Unified Framework for Continuous-Time Unconstrained Distributed Optimization, Distributed nonsmooth convex optimization over Markovian switching random networks with two step-sizes, Distributed algorithm design for optimal resource allocation problems via incremental passivity theory, A Simple Parallel Algorithm with an $O(1/t)$ Convergence Rate for General Convex Programs, Distributed approximate Newton algorithms and weight design for constrained optimization, Iteration complexity analysis of dual first-order methods for conic convex programming, Distributed Newton methods for strictly convex consensus optimization problems in multi-agent networks, Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing, Primal recovery from consensus-based dual decomposition for distributed convex optimization, Newton-like Method with Diagonal Correction for Distributed Optimization