Preprint · 2014 · Open access
A Primal-Dual Algorithmic Framework for Constrained Convex Minimization
arXiv (Cornell University) · Published 20 June 2014 · DOI 10.48550/arxiv.1406.5403
In brief
“A Primal-Dual Algorithmic Framework for Constrained Convex Minimization” is a 2014 preprint by Quoc Tran-Dinh and Volkan Cevher, published in arXiv (Cornell University). OpenAlex counts 36 citations as of 16 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 36
- Most cited in
- 2016 (7)
- References
- 69
- Authors
- 2
Abstract
We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical constrained convex optimization problem, and rigorously characterize how common structural assumptions affect the numerical efficiency. Our main analysis technique provides a fresh perspective on Nesterov's excessive gap technique in a structured fashion and unifies it with smoothing and primal-dual methods. For instance, through the choices of a dual smoothing strategy and a center point, our framework subsumes decomposition algorithms, augmented Lagrangian as well as the alternating direction method-of-multipliers methods as its special cases, and provides optimal convergence rates on the primal objective residual as well as the primal feasibility gap of the iterates for all.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Tran-Dinh, Q., & Cevher, V. (2014). A Primal-Dual Algorithmic Framework for Constrained Convex Minimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1406.5403
MLA 9
Tran-Dinh, Quoc, and Volkan Cevher. “A Primal-Dual Algorithmic Framework for Constrained Convex Minimization.” arXiv (Cornell University), 2014. https://doi.org/10.48550/arxiv.1406.5403.
Chicago
Tran-Dinh, Quoc and Volkan Cevher. 2014. “A Primal-Dual Algorithmic Framework for Constrained Convex Minimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1406.5403.
Harvard
Tran-Dinh, Q. and Cevher, V. (2014) ‘A Primal-Dual Algorithmic Framework for Constrained Convex Minimization’, arXiv (Cornell University). doi:10.48550/arxiv.1406.5403.
IEEE
Q. Tran-Dinh and V. Cevher, “A Primal-Dual Algorithmic Framework for Constrained Convex Minimization,” arXiv (Cornell University), 2014, doi: 10.48550/arxiv.1406.5403.
BibTeX
@misc{trandinh2014primal,
title = {{A Primal-Dual Algorithmic Framework for Constrained Convex Minimization}},
author = {Tran-Dinh, Quoc and Cevher, Volkan},
howpublished = {arXiv (Cornell University)},
year = {2014},
doi = {10.48550/arxiv.1406.5403},
url = {https://doi.org/10.48550/arxiv.1406.5403}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2016 | 7 | |
| 2017 | 3 | |
| 2018 | 3 | |
| 2019 | 1 | |
| 2020 | 1 | |
| 2021 | 3 | |
| 2022 | 2 | |
| 2024 | 3 | |
| 2025 | 1 | |
| 2026 | 2 |
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- primal-dual algorithm
- constrained convex optimization
- decomposition method
- augmented Lagrangian method
- alternating direction method of multipliers
- convergence rate
- approximate solutions
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?
Tran-Dinh, Q., & Cevher, V. (2014). A Primal-Dual Algorithmic Framework for Constrained Convex Minimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1406.5403
How many times has this paper been cited?
36 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 arXiv (Cornell University).
Who wrote this paper?
Quoc Tran-Dinh, Volkan Cevher.
What is the DOI of this paper?
10.48550/arxiv.1406.5403. The permanent link is https://doi.org/10.48550/arxiv.1406.5403.
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.