Journal article · 2016 · Open access

A family of subgradient-based methods for convex optimization problems in a unifying framework

Masaru Ito, Mituhiro Fukuda

Optimization methods & software, 31(5), 952–982 · Published 7 July 2016 · DOI 10.1080/10556788.2016.1182165

Free PDFView at the publisherCite this paper

In brief

“A family of subgradient-based methods for convex optimization problems in a unifying framework” is a 2016 journal article by Masaru Ito and Mituhiro Fukuda, published in Optimization methods & software. OpenAlex counts 11 citations as of 16 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
11
Most cited in
2016 (2)
Field-weighted impact
1.93
References
30
Authors
2

Abstract

We propose a new family of subgradient- and gradient-based methods which converges with optimal complexity for convex optimization problems whose feasible region is simple enough. This includes cases where the objective function is non-smooth, smooth, have composite/saddle structure, or are given by an inexact oracle model. We unified the way of constructing the subproblems which are necessary to be solved at each iteration of these methods. This permitted us to analyse the convergence of these methods in a unified way compared to previous results which required different approaches for each method/algorithm. Our contribution rely on two well-known methods in non-smooth convex optimization: the mirror-descent method (MDM) by Nemirovski-Yudin and the dual-averaging method by Nesterov. Therefore, our family of methods includes them and many other methods as particular cases. For instance, the proposed family of classical gradient methods and its accelerations generalize Devolder et al.'s, Nesterov's primal/dual gradient methods, and Tseng's accelerated proximal gradient methods. Also our family of methods can partially become special cases of other universal methods, too. As an additional contribution, the novel extended MDM removes the compactness assumption of the feasible region and the fixation of the total number of iterations which is required by the original MDM in order to attain the optimal complexity.

Cite this paper

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

APA 7

Ito, M., & Fukuda, M. (2016). A family of subgradient-based methods for convex optimization problems in a unifying framework. Optimization methods & software, 31(5), 952–982. https://doi.org/10.1080/10556788.2016.1182165

MLA 9

Ito, Masaru, and Mituhiro Fukuda. “A family of subgradient-based methods for convex optimization problems in a unifying framework.” Optimization methods & software, vol. 31, no. 5, 2016, pp. 952–982. https://doi.org/10.1080/10556788.2016.1182165.

Chicago

Ito, Masaru and Mituhiro Fukuda. 2016. “A family of subgradient-based methods for convex optimization problems in a unifying framework.” Optimization methods & software 31 (5): 952–982. https://doi.org/10.1080/10556788.2016.1182165.

Harvard

Ito, M. and Fukuda, M. (2016) ‘A family of subgradient-based methods for convex optimization problems in a unifying framework’, Optimization methods & software, 31(5), pp. 952–982. doi:10.1080/10556788.2016.1182165.

IEEE

M. Ito and M. Fukuda, “A family of subgradient-based methods for convex optimization problems in a unifying framework,” Optimization methods & software, vol. 31, no. 5, pp. 952–982, 2016, doi: 10.1080/10556788.2016.1182165.

BibTeX

@article{ito2016family,
  title     = {{A family of subgradient-based methods for convex optimization problems in a unifying framework}},
  author    = {Ito, Masaru and Fukuda, Mituhiro},
  journal   = {Optimization methods \& software},
  year      = {2016},
  volume    = {31},
  number    = {5},
  pages     = {952--982},
  doi       = {10.1080/10556788.2016.1182165},
  url       = {https://doi.org/10.1080/10556788.2016.1182165}
}

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

Citations by year

YearCitationsShare of the best year
201511
201622
201722
201822
201911
202522
202611

Its field-weighted citation impact is 1.93: it has been cited 1.93 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
  • optimal complexity
  • dual averaging
  • nonsmooth optimization
  • saddle point problems
  • composite objective function
  • inexact oracle
  • accelerated gradient methods

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?

Ito, M., & Fukuda, M. (2016). A family of subgradient-based methods for convex optimization problems in a unifying framework. Optimization methods & software, 31(5), 952–982. https://doi.org/10.1080/10556788.2016.1182165

How many times has this paper been cited?

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

Masaru Ito, Mituhiro Fukuda.

What is the DOI of this paper?

10.1080/10556788.2016.1182165. The permanent link is https://doi.org/10.1080/10556788.2016.1182165.

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.