A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks
From MaRDI portal
Publication:2280910
Recommendations
Cites work
- Approximate volume and integration for basic semialgebraic sets
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 3561857 (Why is no real title available?)
- Moments, positive polynomials and their applications
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Semidefinite programming for chance constrained optimization over semialgebraic sets
Cited in
(4)- A distributed optimization algorithm in connection-less networks
- Necessary and sufficient condition for non-concave network utility maximisation
- Distributed resource allocation algorithm for second-order multi-agent systems with external disturbances
- Time-varying distributed fuzzy resource allocation for multi-agent system over switching topology
This page was built for publication: A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280910)