Dual subgradient method with averaging for optimal resource allocation

Yu. Nesterov and V. Shikhman

European Journal of Operational Research, 2018, vol. 270, issue 3, 907-916

Abstract: A dual subgradient method is proposed for solving convex optimization problems with linear constraints. As novelty, the recovering of primal solutions can be avoided. Instead, the optimal convergence rate for the whole sequence of primal-dual iterates is obtained. This is due to the primal-dual averaging strategies which are incorporated into the iterative scheme. We apply our dual subgradient method with averaging to optimal resource allocation within a multi-agent environment. The proposed dual subgradient method naturally corresponds to a distributed process of production/price adjustments and effectively leads to a market equilibrium.

Keywords: Convex programming; Dual subgradient methods; Rate of convergence; Averaging; Resource allocation (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221717308913
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:270:y:2018:i:3:p:907-916

DOI: 10.1016/j.ejor.2017.09.043

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().