Journal article · 1997
Separating plane algorithms for convex optimization
Mathematical Programming, 76(3), 373–391 · Published 1 March 1997 · DOI 10.1007/bf02614389
In brief
“Separating plane algorithms for convex optimization” is a 1997 journal article by E. A. Nurminskii, published in Mathematical Programming. OpenAlex counts 17 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 17
- Most cited in
- 2020 (5)
- References
- 23
- Authors
- 1
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Nurminskii, E. A. (1997). Separating plane algorithms for convex optimization. Mathematical Programming, 76(3), 373–391. https://doi.org/10.1007/bf02614389
MLA 9
Nurminskii, E. A. “Separating plane algorithms for convex optimization.” Mathematical Programming, vol. 76, no. 3, 1997, pp. 373–391. https://doi.org/10.1007/bf02614389.
Chicago
Nurminskii, E. A. 1997. “Separating plane algorithms for convex optimization.” Mathematical Programming 76 (3): 373–391. https://doi.org/10.1007/bf02614389.
Harvard
Nurminskii, E. A. (1997) ‘Separating plane algorithms for convex optimization’, Mathematical Programming, 76(3), pp. 373–391. doi:10.1007/bf02614389.
IEEE
E. A. Nurminskii, “Separating plane algorithms for convex optimization,” Mathematical Programming, vol. 76, no. 3, pp. 373–391, 1997, doi: 10.1007/bf02614389.
BibTeX
@article{nurminskii1997separating,
title = {{Separating plane algorithms for convex optimization}},
author = {Nurminskii, E. A.},
journal = {Mathematical Programming},
year = {1997},
volume = {76},
number = {3},
pages = {373--391},
doi = {10.1007/bf02614389},
url = {https://doi.org/10.1007/bf02614389}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2013 | 1 | |
| 2015 | 2 | |
| 2016 | 2 | |
| 2017 | 2 | |
| 2018 | 2 | |
| 2019 | 1 | |
| 2020 | 5 |
Topic and keywords
Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- convex optimization
- conjugate functions
- duality
- constrained optimization
- unconstrained optimization
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Nurminskii, E. A. (1997). Separating plane algorithms for convex optimization. Mathematical Programming, 76(3), 373–391. https://doi.org/10.1007/bf02614389
How many times has this paper been cited?
17 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?
E. A. Nurminskii.
What is the DOI of this paper?
10.1007/bf02614389. The permanent link is https://doi.org/10.1007/bf02614389.
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.