Composite optimization for the resource allocation problem
From MaRDI portal
Publication:5085260
Abstract: In this paper we consider resource allocation problem stated as a convex minimization problem with linear constraints. To solve this problem, we use gradient and accelerated gradient descent applied to the dual problem and prove the convergence rate both for the primal iterates and the dual iterates. We obtain faster convergence rates than the ones known in the literature. We also provide economic interpretation for these two methods. This means that iterations of the algorithms naturally correspond to the process of price and production adjustment in order to obtain the desired production volume in the economy. Overall, we show how these actions of the economic agents lead the whole system to the equilibrium.
Recommendations
- Dual subgradient method with averaging for optimal resource allocation
- Optimal scaling of a gradient method for distributed resource allocation
- Numerical methods for the resource allocation problem in a computer network
- Distributed stochastic mirror descent algorithm for resource allocation problem
- scientific article; zbMATH DE number 37746
Cites work
- scientific article; zbMATH DE number 3878617 (Why is no real title available?)
- scientific article; zbMATH DE number 4028079 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- Dual subgradient method with averaging for optimal resource allocation
- Fast Distributed Gradient Methods
- Fast primal-dual gradient method for strongly convex minimization problems with linear constraints
- Mirror descent and convex optimization problems with non-smooth inequality constraints
- Numerical methods for the resource allocation problem in a computer network
- Optimal convergence rates for convex distributed optimization in networks
- Parallel algorithms and probability of large deviation for stochastic convex optimization problems
- Smooth minimization of non-smooth functions
- The complexity of resource allocation and price mechanisms under bounded rationality
- Universal method of searching for equilibria and stochastic equilibria in transportation networks
Cited in
(8)- Selective bi-coordinate variations for resource allocation type problems
- Dual subgradient method with averaging for optimal resource allocation
- Numerical methods for the resource allocation problem in a computer network
- scientific article; zbMATH DE number 4087406 (Why is no real title available?)
- Advances in Information Retrieval
- Alternating minimization methods for strongly convex optimization
- An accelerated decentralized stochastic optimization algorithm with inexact model
- A distributed primal-dual hybrid gradient algorithm for fair resource allocation
This page was built for publication: Composite optimization for the resource allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085260)
