Preprint · 2017 · Open access

On a Class of First-order Primal-Dual Algorithms for Composite Convex Minimization Problems

Seyoon Ko, Donghyeon Yu, Joong‐Ho Won

arXiv (Cornell University) · Published 21 February 2017

Read the free full textCite this paper

In brief

“On a Class of First-order Primal-Dual Algorithms for Composite Convex Minimization Problems” is a 2017 preprint by Seyoon Ko and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 2 citations as of 15 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
2
Most cited in
2019 (1)
Authors
3

Abstract

Many statistical learning problems can be posed as minimization of a sum of two convex functions, one typically a composition of non-smooth and linear functions. Examples include regression under structured sparsity assumptions. Popular algorithms for solving such problems, e.g., ADMM, often involve non-trivial optimization subproblems or smoothing approximation. We consider two classes of primal-dual algorithms that do not incur these difficulties, and unify them from a perspective of monotone operator theory. From this unification we propose a continuum of preconditioned forward-backward operator splitting algorithms amenable to parallel and distributed computing. For the entire region of convergence of the whole continuum of algorithms, we establish its rates of convergence. For some known instances of this continuum, our analysis closes the gap in theory. We further exploit the unification to propose a continuum of accelerated algorithms. We show that the whole continuum attains the theoretically optimal rate of convergence. The scalability of the proposed algorithms, as well as their convergence behavior, is demonstrated up to 1.2 million variables with a distributed implementation.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Ko, S., Yu, D., & Won, J. (2017). On a Class of First-order Primal-Dual Algorithms for Composite Convex Minimization Problems. arXiv (Cornell University). https://arxiv.org/pdf/1702.06234.pdf

MLA 9

Ko, Seyoon, et al. “On a Class of First-order Primal-Dual Algorithms for Composite Convex Minimization Problems.” arXiv (Cornell University), 2017. https://arxiv.org/pdf/1702.06234.pdf.

Chicago

Ko, Seyoon, Donghyeon Yu, and Joong‐Ho Won. 2017. “On a Class of First-order Primal-Dual Algorithms for Composite Convex Minimization Problems.” arXiv (Cornell University). https://arxiv.org/pdf/1702.06234.pdf.

Harvard

Ko, S., Yu, D. and Won, J. (2017) ‘On a Class of First-order Primal-Dual Algorithms for Composite Convex Minimization Problems’, arXiv (Cornell University). Available at: https://arxiv.org/pdf/1702.06234.pdf.

IEEE

S. Ko, D. Yu, and J. Won, “On a Class of First-order Primal-Dual Algorithms for Composite Convex Minimization Problems,” arXiv (Cornell University), 2017.

BibTeX

@misc{ko2017class,
  title     = {{On a Class of First-order Primal-Dual Algorithms for Composite Convex Minimization Problems}},
  author    = {Ko, Seyoon and Yu, Donghyeon and Won, Joong‐Ho},
  howpublished = {arXiv (Cornell University)},
  year      = {2017},
  url       = {https://arxiv.org/pdf/1702.06234.pdf}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis

  • primal-dual algorithm
  • monotone operators
  • forward-backward splitting
  • preconditioning
  • fast algorithms
  • convergence rate
  • structured sparsity
  • distributed optimization

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Ko, S., Yu, D., & Won, J. (2017). On a Class of First-order Primal-Dual Algorithms for Composite Convex Minimization Problems. arXiv (Cornell University). https://arxiv.org/pdf/1702.06234.pdf

How many times has this paper been cited?

2 times, according to OpenAlex on 15 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?

Seyoon Ko, Donghyeon Yu, Joong‐Ho Won.

Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.