Book chapter · 2020
Numerical Algorithms for Constrained Optimization
CRC Press eBooks, 60–74 · Published 9 December 2020 · DOI 10.1201/9781351119108-7
In brief
“Numerical Algorithms for Constrained Optimization” is a 2020 book chapter by Ossama O. Abdelkhalik, published in CRC Press eBooks. OpenAlex counts 0 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
- Authors
- 1
Abstract
Direct Methods approximate the objective and constraint functions, to simplify the problem. Indirect Methods convert the constrained optimization problem to a sequence of unconstrained optimization problems, to leverage the unconstrained optimization algorithms for solving the more complex constrained problems. In general, constrained optimization problems are more challenging to solve, compared to the unconstrained optimization problems.… 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
Abdelkhalik, O. O. (2020). Numerical Algorithms for Constrained Optimization. CRC Press eBooks, 60–74. https://doi.org/10.1201/9781351119108-7
MLA 9
Abdelkhalik, Ossama O. “Numerical Algorithms for Constrained Optimization.” CRC Press eBooks, 2020, pp. 60–74. https://doi.org/10.1201/9781351119108-7.
Chicago
Abdelkhalik, Ossama O. 2020. “Numerical Algorithms for Constrained Optimization.” CRC Press eBooks: 60–74. https://doi.org/10.1201/9781351119108-7.
Harvard
Abdelkhalik, O. O. (2020) ‘Numerical Algorithms for Constrained Optimization’, CRC Press eBooks, pp. 60–74. doi:10.1201/9781351119108-7.
IEEE
O. O. Abdelkhalik, “Numerical Algorithms for Constrained Optimization,” CRC Press eBooks, pp. 60–74, 2020, doi: 10.1201/9781351119108-7.
BibTeX
@incollection{abdelkhalik2020numerical,
title = {{Numerical Algorithms for Constrained Optimization}},
author = {Abdelkhalik, Ossama O.},
booktitle = {CRC Press eBooks},
publisher = {CRC Press},
year = {2020},
pages = {60--74},
doi = {10.1201/9781351119108-7},
url = {https://doi.org/10.1201/9781351119108-7}
}
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
- constrained optimization
- direct method
- indirect method
- interior point methods
- feasible region
- 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?
Abdelkhalik, O. O. (2020). Numerical Algorithms for Constrained Optimization. CRC Press eBooks, 60–74. https://doi.org/10.1201/9781351119108-7
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?
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?
Ossama O. Abdelkhalik.
What is the DOI of this paper?
10.1201/9781351119108-7, permanently at https://doi.org/10.1201/9781351119108-7. 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.