Necessary and sufficient condition for non-concave network utility maximisation

DOI10.1080/00207179.2019.1599419zbMath1453.93104OpenAlexW2927060781WikidataQ128205937 ScholiaQ128205937MaRDI QIDQ5216432

Qishao Wang, Jinghua Guo, Jingyao Wang, Guan-Rong Chen, Zhi-Sheng Duan

Publication date: 17 February 2020

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207179.2019.1599419

zbMATH Keywords

utility maximisationInternet congestion controlfluid-flow modelnon-concave optimisationtraffic allocation control

Mathematics Subject Classification ID

Control/observation systems involving computers (process control, etc.) (93C83) Utility theory (91B16) Networked control (93B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Appointed-time consensus: accurate and practical designs
• A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Designing Distributed Specified-Time Consensus Protocols for Linear Multiagent Systems Over Directed Graphs
• An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems
• Non-Linear Programming Via Penalty Functions

This page was built for publication: Necessary and sufficient condition for non-concave network utility maximisation