Journal article · 2014 · Open access
Primal convergence from dual subgradient methods for convex optimization
Mathematical Programming, 150(2), 365–390 · Published 15 April 2014 · DOI 10.1007/s10107-014-0772-2
In brief
“Primal convergence from dual subgradient methods for convex optimization” is a 2014 journal article by Emil Gustavsson and 2 co-authors, published in Mathematical Programming. OpenAlex counts 41 citations as of 16 November 2026, which puts it in the top 7% of works published in 2014 by citations. It is open access under a CC BY licence: the full text is free to read at Mathematical Programming.
- Citations
- 41
- Most cited in
- 2017 (5)
- Field-weighted impact
- 3.83
- References
- 44
- Authors
- 3
Abstract
When solving a convex optimization problem through a Lagrangian dual reformulation subgradient optimization methods are favorably utilized, since they often find near-optimal dual solutions quickly. However, an optimal primal solution is generally not obtained directly through such a subgradient approach unless the Lagrangian dual function is differentiable at an optimal solution. We construct a sequence of convex combinations of primal subproblem solutions, a so called ergodic sequence, which is shown to converge to an optimal primal solution when the convexity weights are appropriately chosen. We generalize previous convergence results from linear to convex optimization and present a new set of rules for constructing the convexity weights that define the ergodic sequence of primal solutions. In contrast to previously proposed rules, they exploit more information from later subproblem solutions than from earlier ones. We evaluate the proposed rules on a set of nonlinear multicommodity flow problems and demonstrate that they clearly outperform the ones previously proposed.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Gustavsson, E., Patriksson, M., & Strömberg, A. (2014). Primal convergence from dual subgradient methods for convex optimization. Mathematical Programming, 150(2), 365–390. https://doi.org/10.1007/s10107-014-0772-2
MLA 9
Gustavsson, Emil, et al. “Primal convergence from dual subgradient methods for convex optimization.” Mathematical Programming, vol. 150, no. 2, 2014, pp. 365–390. https://doi.org/10.1007/s10107-014-0772-2.
Chicago
Gustavsson, Emil, Michael Patriksson, and Ann‐Brith Strömberg. 2014. “Primal convergence from dual subgradient methods for convex optimization.” Mathematical Programming 150 (2): 365–390. https://doi.org/10.1007/s10107-014-0772-2.
Harvard
Gustavsson, E., Patriksson, M. and Strömberg, A. (2014) ‘Primal convergence from dual subgradient methods for convex optimization’, Mathematical Programming, 150(2), pp. 365–390. doi:10.1007/s10107-014-0772-2.
IEEE
E. Gustavsson, M. Patriksson, and A. Strömberg, “Primal convergence from dual subgradient methods for convex optimization,” Mathematical Programming, vol. 150, no. 2, pp. 365–390, 2014, doi: 10.1007/s10107-014-0772-2.
BibTeX
@article{gustavsson2014primal,
title = {{Primal convergence from dual subgradient methods for convex optimization}},
author = {Gustavsson, Emil and Patriksson, Michael and Strömberg, Ann‐Brith},
journal = {Mathematical Programming},
year = {2014},
volume = {150},
number = {2},
pages = {365--390},
doi = {10.1007/s10107-014-0772-2},
url = {https://doi.org/10.1007/s10107-014-0772-2}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 5 | |
| 2018 | 3 | |
| 2019 | 3 | |
| 2020 | 4 | |
| 2021 | 5 | |
| 2022 | 3 | |
| 2023 | 2 | |
| 2024 | 3 | |
| 2025 | 3 | |
| 2026 | 3 |
Its field-weighted citation impact is 3.83: it has been cited 3.83 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- convex optimization
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Gustavsson, E., Patriksson, M., & Strömberg, A. (2014). Primal convergence from dual subgradient methods for convex optimization. Mathematical Programming, 150(2), 365–390. https://doi.org/10.1007/s10107-014-0772-2
How many times has this paper been cited?
41 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access: read the free full text at Mathematical Programming.
Who wrote this paper?
Emil Gustavsson, Michael Patriksson, Ann‐Brith Strömberg.
What is the DOI of this paper?
10.1007/s10107-014-0772-2. The permanent link is https://doi.org/10.1007/s10107-014-0772-2.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.