Preprint · 2021 · Open access

Comparing different subgradient methods for solving convex optimization problems with functional constraints

Thi Lan Dinh, Ngoc Hoang Anh Mai

arXiv (Cornell University) · Published 4 January 2021 · DOI 10.48550/arxiv.2101.01045

Free PDFView at the publisherCite this paper

In brief

“Comparing different subgradient methods for solving convex optimization problems with functional constraints” is a 2021 preprint by Thi Lan Dinh and Ngoc Hoang Anh Mai, published in arXiv (Cornell University). OpenAlex counts 1 citations as of 16 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).

Citations
1
Most cited in
2022 (1)
References
6
Authors
2

Abstract

We consider the problem of minimizing a convex, nonsmooth function subject to a closed convex constraint domain. The methods that we propose are reforms of subgradient methods based on Metel--Takeda's paper [Optimization Letters 15.4 (2021): 1491-1504] and Boyd's works [Lecture notes of EE364b, Stanford University, Spring 2013-14, pp. 1-39]. While the former has complexity $\mathcal{O}(\varepsilon^{-2r})$ for all $r> 1$, the complexity of the latter is $\mathcal{O}(\varepsilon^{-2})$. We perform some comparisons between these two methods using several test examples.

Cite this paper

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

APA 7

Dinh, T. L., & Mai, N. H. A. (2021). Comparing different subgradient methods for solving convex optimization problems with functional constraints. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2101.01045

MLA 9

Dinh, Thi Lan, and Ngoc Hoang Anh Mai. “Comparing different subgradient methods for solving convex optimization problems with functional constraints.” arXiv (Cornell University), 2021. https://doi.org/10.48550/arxiv.2101.01045.

Chicago

Dinh, Thi Lan and Ngoc Hoang Anh Mai. 2021. “Comparing different subgradient methods for solving convex optimization problems with functional constraints.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2101.01045.

Harvard

Dinh, T. L. and Mai, N. H. A. (2021) ‘Comparing different subgradient methods for solving convex optimization problems with functional constraints’, arXiv (Cornell University). doi:10.48550/arxiv.2101.01045.

IEEE

T. L. Dinh and N. H. A. Mai, “Comparing different subgradient methods for solving convex optimization problems with functional constraints,” arXiv (Cornell University), 2021, doi: 10.48550/arxiv.2101.01045.

BibTeX

@misc{dinh2021comparing,
  title     = {{Comparing different subgradient methods for solving convex optimization problems with functional constraints}},
  author    = {Dinh, Thi Lan and Mai, Ngoc Hoang Anh},
  howpublished = {arXiv (Cornell University)},
  year      = {2021},
  doi       = {10.48550/arxiv.2101.01045},
  url       = {https://doi.org/10.48550/arxiv.2101.01045}
}

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

  • subgradient method
  • convex optimization
  • nonsmooth optimization
  • functional constraints
  • complexity analysis
  • optimizer comparison

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?

Dinh, T. L., & Mai, N. H. A. (2021). Comparing different subgradient methods for solving convex optimization problems with functional constraints. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2101.01045

How many times has this paper been cited?

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

Thi Lan Dinh, Ngoc Hoang Anh Mai.

What is the DOI of this paper?

10.48550/arxiv.2101.01045. The permanent link is https://doi.org/10.48550/arxiv.2101.01045.

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.