Dual subgradient method with averaging for optimal resource allocation
DOI10.1016/J.EJOR.2017.09.043zbMATH Open1403.90550OpenAlexW2760919998MaRDI QIDQ723992FDOQ723992
Publication date: 25 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://alfresco-guest.uclouvain.be/share/proxy/alfresco/slingshot/node/content/workspace/SpacesStore/e16d84de-41a4-40e1-a4d8-98e4295266b5/coredp2017_13web.pdf
Recommendations
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Composite optimization for the resource allocation problem
- A merit function approach to the subgradient method with averaging
- Optimal scaling of a gradient method for distributed resource allocation
- Primal convergence from dual subgradient methods for convex optimization
Convex programming (90C25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Introductory lectures on convex optimization. A basic course.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- Primal convergence from dual subgradient methods for convex optimization
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems
- Generalized Nash equilibrium problems
- The complexity of resource allocation and price mechanisms under bounded rationality
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs
- Quasi-monotone subgradient methods for nonsmooth convex minimization
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- A merit function approach to the subgradient method with averaging
Cited In (9)
- Resource Allocation in Communication Networks with Large Number of Users: The Dual Stochastic Gradient Method
- Numerical methods for the resource allocation problem in a computer network
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources
- Distributed communication-sliding mirror-descent algorithm for nonsmooth resource allocation problem
- Distributed dual subgradient methods with averaging and applications to grid optimization
- Distributed dual averaging algorithm for multi-agent optimization with coupled constraints.
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Composite optimization for the resource allocation problem
- A distributed primal-dual hybrid gradient algorithm for fair resource allocation
This page was built for publication: Dual subgradient method with averaging for optimal resource allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723992)
