Necessary and sufficient condition for non-concave network utility maximisation

DOI10.1080/00207179.2019.1599419MaRDI QIDQ5216432zbMATH OpenOpenAlexWikidataFDO

Authors Jingyao Wang, Jinghua Guo, Qishao Wang, Zhisheng Duan, Guanrong Chen

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

fluid-flow modelInternet congestion controlnon-concave optimisationtraffic allocation controlutility maximisation

Mathematics Subject Classification ID

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

Recommendations

• Parametric network utility maximization problem
• A concavity result for network design problems
• Utility Maximization for Communication Networks With Multipath Routing
• Maximum network flows with concave gains
• Optimal improvement of communication network congestion via nonlinear programming with generalized Nash equilibrium constraints
• Optimal Efficiency Guarantees for Network Design Mechanisms
• Publication:4491701
• A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
• A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks

Cites work

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

Cited in

(2)

• A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks
• A distributed optimization algorithm in connection-less networks

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

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