Journal article · 1990 · Open access
SOME SUFFICIENT CONDITIONS IN CONSTRAINED NONSMOOTH OPTIMIZATION
Demonstratio Mathematica, 23(1) · Published 1 January 1990 · DOI 10.1515/dema-1990-0113
In brief
“SOME SUFFICIENT CONDITIONS IN CONSTRAINED NONSMOOTH OPTIMIZATION” is a 1990 journal article by Joanna Szymaiska-Zagrodny, published in Demonstratio Mathematica. OpenAlex counts 0 citations as of 16 November 2026. It is open access under a CC BY-NC-ND licence: the full text is free to read at Demonstratio Mathematica.
- Citations
- 0
- Authors
- 1
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Szymaiska-Zagrodny, J. (1990). SOME SUFFICIENT CONDITIONS IN CONSTRAINED NONSMOOTH OPTIMIZATION. Demonstratio Mathematica, 23(1). https://doi.org/10.1515/dema-1990-0113
MLA 9
Szymaiska-Zagrodny, Joanna. “SOME SUFFICIENT CONDITIONS IN CONSTRAINED NONSMOOTH OPTIMIZATION.” Demonstratio Mathematica, vol. 23, no. 1, 1990. https://doi.org/10.1515/dema-1990-0113.
Chicago
Szymaiska-Zagrodny, Joanna. 1990. “SOME SUFFICIENT CONDITIONS IN CONSTRAINED NONSMOOTH OPTIMIZATION.” Demonstratio Mathematica 23 (1). https://doi.org/10.1515/dema-1990-0113.
Harvard
Szymaiska-Zagrodny, J. (1990) ‘SOME SUFFICIENT CONDITIONS IN CONSTRAINED NONSMOOTH OPTIMIZATION’, Demonstratio Mathematica, 23(1). doi:10.1515/dema-1990-0113.
IEEE
J. Szymaiska-Zagrodny, “SOME SUFFICIENT CONDITIONS IN CONSTRAINED NONSMOOTH OPTIMIZATION,” Demonstratio Mathematica, vol. 23, no. 1, 1990, doi: 10.1515/dema-1990-0113.
BibTeX
@article{szymaiskazagrodny1990some,
title = {{SOME SUFFICIENT CONDITIONS IN CONSTRAINED NONSMOOTH OPTIMIZATION}},
author = {Szymaiska-Zagrodny, Joanna},
journal = {Demonstratio Mathematica},
year = {1990},
volume = {23},
number = {1},
doi = {10.1515/dema-1990-0113},
url = {https://doi.org/10.1515/dema-1990-0113}
}
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
- sufficient optimality conditions
- optimality conditions
- nonsmooth 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?
Szymaiska-Zagrodny, J. (1990). SOME SUFFICIENT CONDITIONS IN CONSTRAINED NONSMOOTH OPTIMIZATION. Demonstratio Mathematica, 23(1). https://doi.org/10.1515/dema-1990-0113
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 Demonstratio Mathematica.
Who wrote this paper?
Joanna Szymaiska-Zagrodny.
What is the DOI of this paper?
10.1515/dema-1990-0113. The permanent link is https://doi.org/10.1515/dema-1990-0113.
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.