Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions

DOI10.1109/TCNS.2018.2889011OpenAlexW2906493430WikidataQ128729394 ScholiaQ128729394MaRDI QIDQ5211931

Hideaki Iiduka

Publication date: 28 January 2020

Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcns.2018.2889011

Mathematics Subject Classification ID

Systems theory; control (93-XX) Operations research, mathematical programming (90-XX)

Related Items

Stochastic approximation method using diagonal positive-definite matrices for convex optimization with fixed point constraints ⋮ Distributed communication-sliding mirror-descent algorithm for nonsmooth resource allocation problem ⋮ An asynchronous subgradient-proximal method for solving additive convex optimization problems ⋮ A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints ⋮ Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators ⋮ Proximal nested primal-dual gradient algorithms for distributed constraint-coupled composite optimization ⋮ Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets ⋮ Decentralized hierarchical constrained convex optimization ⋮ Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints ⋮ Iterative methods for parallel convex optimization with fixed point constraints