Book chapter · 1990
6. Convex Programming
Society for Industrial and Applied Mathematics eBooks, 86–112 · Published 1 January 1990 · DOI 10.1137/1.9781611971316.ch6
In brief
“6. Convex Programming” is a 1990 book chapter, published in Society for Industrial and Applied Mathematics eBooks. OpenAlex counts 0 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
Abstract
In all the development thus far the main restriction on the problem functions was the order of their differentiability. The theorems that were proved were about “local minima” since it was recognized that in general, given information at a point, one can only make statements about what is true in a neighborhood about that point.… 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
6. Convex Programming. (1990). Society for Industrial and Applied Mathematics eBooks, 86–112. https://doi.org/10.1137/1.9781611971316.ch6
MLA 9
“6. Convex Programming.” Society for Industrial and Applied Mathematics eBooks, 1990, pp. 86–112. https://doi.org/10.1137/1.9781611971316.ch6.
Chicago
1990. “6. Convex Programming.” Society for Industrial and Applied Mathematics eBooks: 86–112. https://doi.org/10.1137/1.9781611971316.ch6.
Harvard
(1990) ‘6. Convex Programming’, Society for Industrial and Applied Mathematics eBooks, pp. 86–112. doi:10.1137/1.9781611971316.ch6.
IEEE
“6. Convex Programming,” Society for Industrial and Applied Mathematics eBooks, pp. 86–112, 1990, doi: 10.1137/1.9781611971316.ch6.
BibTeX
@incollection{anon1990convex,
title = {{6. Convex Programming}},
booktitle = {Society for Industrial and Applied Mathematics eBooks},
publisher = {Society for Industrial and Applied Mathematics},
year = {1990},
pages = {86--112},
doi = {10.1137/1.9781611971316.ch6},
url = {https://doi.org/10.1137/1.9781611971316.ch6}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- convex optimization
- global minimum
- local minima
- optimality conditions
- duality theory
- unconstrained optimization
- global convergence
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?
6. Convex Programming. (1990). Society for Industrial and Applied Mathematics eBooks, 86–112. https://doi.org/10.1137/1.9781611971316.ch6
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?
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.
What is the DOI of this paper?
10.1137/1.9781611971316.ch6. The permanent link is https://doi.org/10.1137/1.9781611971316.ch6.
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.