Journal article · 1989
Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
Optimization, 20(4), 451–456 · Published 1 January 1989 · DOI 10.1080/02331938908843463
In brief
“Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints” is a 1989 journal article by Se Hoon Kim and Bong-Sik Um, published in Optimization. OpenAlex counts 7 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 7
- References
- 9
- Authors
- 2
Abstract
The projection operation required in the Polyak's subgradient method for nondifferentiable optimization problems with linear constraints is simplified. The modified method finds a new search direction in the cone of feasible directions at the current point. This greatly reduces the dimension of the projection operation. A computational test shows significant improvement in the computational efficiency. 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
Kim, S. H., & Um, B.-S. (1989). Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints. Optimization, 20(4), 451–456. https://doi.org/10.1080/02331938908843463
MLA 9
Kim, Se Hoon, and Bong-Sik Um. “Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints.” Optimization, vol. 20, no. 4, 1989, pp. 451–456. https://doi.org/10.1080/02331938908843463.
Chicago
Kim, Se Hoon and Bong-Sik Um. 1989. “Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints.” Optimization 20 (4): 451–456. https://doi.org/10.1080/02331938908843463.
Harvard
Kim, S. H. and Um, B.-S. (1989) ‘Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints’, Optimization, 20(4), pp. 451–456. doi:10.1080/02331938908843463.
IEEE
S. H. Kim and B.-S. Um, “Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints,” Optimization, vol. 20, no. 4, pp. 451–456, 1989, doi: 10.1080/02331938908843463.
BibTeX
@article{kim1989polyak,
title = {{Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints}},
author = {Kim, Se Hoon and Um, Bong-Sik},
journal = {Optimization},
year = {1989},
volume = {20},
number = {4},
pages = {451--456},
doi = {10.1080/02331938908843463},
url = {https://doi.org/10.1080/02331938908843463}
}
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 optimization
- linear constraints
- projection operation
- feasible directions
- search direction
- computational efficiency
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Kim, S. H., & Um, B.-S. (1989). Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints. Optimization, 20(4), 451–456. https://doi.org/10.1080/02331938908843463
How many times has this paper been cited?
7 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?
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?
Se Hoon Kim, Bong-Sik Um.
What is the DOI of this paper?
10.1080/02331938908843463. The permanent link is https://doi.org/10.1080/02331938908843463.
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.