Numerical methods for the resource allocation problem in a computer network
From MaRDI portal
Publication:2662812
DOI10.1134/S0965542521020135zbMath1460.90051OpenAlexW3146430937MaRDI QIDQ2662812
Publication date: 15 April 2021
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542521020135
resource allocationcommunication networksfast gradient methodellipsoid methodnetwork utility maximizationprimal-dual propertyrandom gradient extrapolation methodstochastic projected subgradient method
Communication networks in operations research (90B18) Deterministic network models in operations research (90B10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
Network Utility Maximization by Updating Individual Transmission Rates ⋮ Composite optimization for the resource allocation problem ⋮ Alternating minimization methods for strongly convex optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Efficient numerical methods for entropy-linear programming problems
- Lectures on convex optimization
- Dual subgradient method with averaging for optimal resource allocation
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- The complexity of resource allocation and price mechanisms under bounded rationality
- Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
- Introduction to Nonlinear Optimization
- Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Accuracy Certificates for Computational Problems with Convex Structure
- Random Gradient Extrapolation for Distributed and Stochastic Optimization
