Preprint · 2026 · Open access

Specular gradient methods for nonsmooth convex optimization in Euclidean spaces: a subgradient selection strategy

Kiyuob Jung

arXiv (Cornell University) · Published 25 May 2026 · DOI 10.48550/arxiv.2605.25490

Free PDFView at the publisherCite this paper

In brief

“Specular gradient methods for nonsmooth convex optimization in Euclidean spaces: a subgradient selection strategy” is a 2026 preprint by Kiyuob Jung, published in arXiv (Cornell University). OpenAlex counts 0 citations as of 16 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
0
References
18
Authors
1

Abstract

This paper deals with nonsmooth convex optimization problems in Euclidean spaces. We identify special elements of the subdifferential of a convex function, called specular gradients. Based on this observation, we propose three numerical methods that use specular gradients in subgradient methods. We prove the convergence of the proposed methods under suitable step sizes. Numerical experiments demonstrate that the proposed methods are capable of minimizing non-differentiable functions that classical methods fail to minimize.

Cite this paper

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

APA 7

Jung, K. (2026). Specular gradient methods for nonsmooth convex optimization in Euclidean spaces: a subgradient selection strategy. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2605.25490

MLA 9

Jung, Kiyuob. “Specular gradient methods for nonsmooth convex optimization in Euclidean spaces: a subgradient selection strategy.” arXiv (Cornell University), 2026. https://doi.org/10.48550/arxiv.2605.25490.

Chicago

Jung, Kiyuob. 2026. “Specular gradient methods for nonsmooth convex optimization in Euclidean spaces: a subgradient selection strategy.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2605.25490.

Harvard

Jung, K. (2026) ‘Specular gradient methods for nonsmooth convex optimization in Euclidean spaces: a subgradient selection strategy’, arXiv (Cornell University). doi:10.48550/arxiv.2605.25490.

IEEE

K. Jung, “Specular gradient methods for nonsmooth convex optimization in Euclidean spaces: a subgradient selection strategy,” arXiv (Cornell University), 2026, doi: 10.48550/arxiv.2605.25490.

BibTeX

@misc{jung2026specular,
  title     = {{Specular gradient methods for nonsmooth convex optimization in Euclidean spaces: a subgradient selection strategy}},
  author    = {Jung, Kiyuob},
  howpublished = {arXiv (Cornell University)},
  year      = {2026},
  doi       = {10.48550/arxiv.2605.25490},
  url       = {https://doi.org/10.48550/arxiv.2605.25490}
}

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

  • nonsmooth convex optimization
  • subgradient method
  • subdifferential
  • non-differentiable functions
  • convergence analysis
  • step size selection

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?

Jung, K. (2026). Specular gradient methods for nonsmooth convex optimization in Euclidean spaces: a subgradient selection strategy. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2605.25490

How many times has this paper been cited?

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

Kiyuob Jung.

What is the DOI of this paper?

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

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.