Book chapter · 2020 · Open access
One-Dimensional Optimization Problem
CRC Press eBooks, 1–14 · Published 16 November 2020 · DOI 10.1201/9781003105213-1
In brief
“One-Dimensional Optimization Problem” is a 2020 book chapter by Nita H. Shah and Poonam Prakash Mishra, published in CRC Press eBooks. OpenAlex counts 0 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at CRC Press eBooks.
- Citations
- 0
- Authors
- 2
Abstract
Chapter 1 discusses non-linear programming for unimodal functions with single variable without constraints. Here we discus both conventional gradient-based methods and search algorithms for unimodal functions. These approaches act as fundamental for multivariable problems. We have also compared various approaches available to obtain solution and illustrate them briefly.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Shah, N. H., & Mishra, P. P. (2020). One-Dimensional Optimization Problem. CRC Press eBooks, 1–14. https://doi.org/10.1201/9781003105213-1
MLA 9
Shah, Nita H., and Poonam Prakash Mishra. “One-Dimensional Optimization Problem.” CRC Press eBooks, 2020, pp. 1–14. https://doi.org/10.1201/9781003105213-1.
Chicago
Shah, Nita H. and Poonam Prakash Mishra. 2020. “One-Dimensional Optimization Problem.” CRC Press eBooks: 1–14. https://doi.org/10.1201/9781003105213-1.
Harvard
Shah, N. H. and Mishra, P. P. (2020) ‘One-Dimensional Optimization Problem’, CRC Press eBooks, pp. 1–14. doi:10.1201/9781003105213-1.
IEEE
N. H. Shah and P. P. Mishra, “One-Dimensional Optimization Problem,” CRC Press eBooks, pp. 1–14, 2020, doi: 10.1201/9781003105213-1.
BibTeX
@incollection{shah2020dimensional,
title = {{One-Dimensional Optimization Problem}},
author = {Shah, Nita H. and Mishra, Poonam Prakash},
booktitle = {CRC Press eBooks},
publisher = {CRC Press},
year = {2020},
pages = {1--14},
doi = {10.1201/9781003105213-1},
url = {https://doi.org/10.1201/9781003105213-1}
}
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
- one-dimensional optimization
- unimodal functions
- gradient-based optimization
- search algorithms
- optimizer comparison
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?
Shah, N. H., & Mishra, P. P. (2020). One-Dimensional Optimization Problem. CRC Press eBooks, 1–14. https://doi.org/10.1201/9781003105213-1
How many times has this paper been cited?
0 times, according to OpenAlex on 19 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 at CRC Press eBooks: sign in and open the full text from this page.
Who wrote this paper?
Nita H. Shah, Poonam Prakash Mishra.
What is the DOI of this paper?
10.1201/9781003105213-1, permanently at https://doi.org/10.1201/9781003105213-1. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.