Book chapter · 1985
Aggregate subgradient methods for unconstrained convex minimization
Lecture notes in mathematics, 44–86 · Published 1 January 1985 · DOI 10.1007/bfb0074502
In brief
“Aggregate subgradient methods for unconstrained convex minimization” is a 1985 book chapter by Krzysztof Czesław Kiwiel, published in Lecture notes in mathematics. OpenAlex counts 1 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 1
- Field-weighted impact
- 1.21
- Authors
- 1
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Kiwiel, K. C. (1985). Aggregate subgradient methods for unconstrained convex minimization. Lecture notes in mathematics, 44–86. https://doi.org/10.1007/bfb0074502
MLA 9
Kiwiel, Krzysztof Czesław. “Aggregate subgradient methods for unconstrained convex minimization.” Lecture notes in mathematics, 1985, pp. 44–86. https://doi.org/10.1007/bfb0074502.
Chicago
Kiwiel, Krzysztof Czesław. 1985. “Aggregate subgradient methods for unconstrained convex minimization.” Lecture notes in mathematics: 44–86. https://doi.org/10.1007/bfb0074502.
Harvard
Kiwiel, K. C. (1985) ‘Aggregate subgradient methods for unconstrained convex minimization’, Lecture notes in mathematics, pp. 44–86. doi:10.1007/bfb0074502.
IEEE
K. C. Kiwiel, “Aggregate subgradient methods for unconstrained convex minimization,” Lecture notes in mathematics, pp. 44–86, 1985, doi: 10.1007/bfb0074502.
BibTeX
@incollection{kiwiel1985aggregate,
title = {{Aggregate subgradient methods for unconstrained convex minimization}},
author = {Kiwiel, Krzysztof Czesław},
booktitle = {Lecture notes in mathematics},
publisher = {Springer Nature},
year = {1985},
pages = {44--86},
doi = {10.1007/bfb0074502},
url = {https://doi.org/10.1007/bfb0074502}
}
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
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?
Kiwiel, K. C. (1985). Aggregate subgradient methods for unconstrained convex minimization. Lecture notes in mathematics, 44–86. https://doi.org/10.1007/bfb0074502
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?
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?
Krzysztof Czesław Kiwiel.
What is the DOI of this paper?
10.1007/bfb0074502. The permanent link is https://doi.org/10.1007/bfb0074502.
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.