Paper · 2017

A Continuum of Optimal Primal-Dual Algorithms for Convex Composite Minimization Problems with Applications to Structured Sparsity

Seyoon Ko, Donghyeon Yu, Joong‐Ho Won

Published 21 February 2017

View at the publisherCite this paper

In brief

“A Continuum of Optimal Primal-Dual Algorithms for Convex Composite Minimization Problems with Applications to Structured Sparsity” is a 2017 paper by Seyoon Ko and 2 co-authors. OpenAlex counts 0 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
0
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… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

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). A Continuum of Optimal Primal-Dual Algorithms for Convex Composite Minimization Problems with Applications to Structured Sparsity. http://export.arxiv.org/pdf/1702.06234

MLA 9

Ko, Seyoon, et al. “A Continuum of Optimal Primal-Dual Algorithms for Convex Composite Minimization Problems with Applications to Structured Sparsity.” 2017. http://export.arxiv.org/pdf/1702.06234.

Chicago

Ko, Seyoon, Donghyeon Yu, and Joong‐Ho Won. 2017. “A Continuum of Optimal Primal-Dual Algorithms for Convex Composite Minimization Problems with Applications to Structured Sparsity.” http://export.arxiv.org/pdf/1702.06234.

Harvard

Ko, S., Yu, D. and Won, J. (2017) ‘A Continuum of Optimal Primal-Dual Algorithms for Convex Composite Minimization Problems with Applications to Structured Sparsity’. Available at: http://export.arxiv.org/pdf/1702.06234.

IEEE

S. Ko, D. Yu, and J. Won, “A Continuum of Optimal Primal-Dual Algorithms for Convex Composite Minimization Problems with Applications to Structured Sparsity,” 2017.

BibTeX

@article{ko2017continuum,
  title     = {{A Continuum of Optimal Primal-Dual Algorithms for Convex Composite Minimization Problems with Applications to Structured Sparsity}},
  author    = {Ko, Seyoon and Yu, Donghyeon and Won, Joong‐Ho},
  year      = {2017},
  url       = {http://export.arxiv.org/pdf/1702.06234}
}

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
  • structured sparsity
  • monotone operators
  • forward-backward splitting
  • preconditioning
  • fast algorithms
  • convergence rate
  • 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). A Continuum of Optimal Primal-Dual Algorithms for Convex Composite Minimization Problems with Applications to Structured Sparsity. http://export.arxiv.org/pdf/1702.06234

How many times has this paper been cited?

0 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?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

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.