Dissertation · 2010 · Open access
Penalty and Barrier Function Methods for Constrained Optimization Problems
National Academic Digital Repository of Ethiopia · Published 1 June 2010 · DOI 10.20372/nadre/7919
In brief
“Penalty and Barrier Function Methods for Constrained Optimization Problems” is a 2010 dissertation by Hailay Weldegiorgis, published in National Academic Digital Repository of Ethiopia. OpenAlex counts 1 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at National Academic Digital Repository of Ethiopia.
- Citations
- 1
- Most cited in
- 2020 (1)
- Authors
- 1
Abstract
The purpose of the study was to explore how effectively the penalty and barrier function methods are able to solve constrained optimization problems. The approach in these methods is that to transform the constrained problem into an equivalent unconstrained problem or into a problem with simple constraints, and solved using one (or some variant) of the algorithms for unconstrained optimization problems. Lemmas and theorems are proved which ensure the convergence of the sequence of solu-tions of the unconstrained problem into the solution of the original constrained optimiza-tion problem as the penalty parameter goes to infinity in the case of penalty methods and as the barrier parameter approaches to zero in barrier methods. Algorithms and MAT-LAB codes are developed using Powell's method for unconstrained optimization prob-lems for both penalty and barrier function methods and then problems that have appeared frequently in the optimization literature which have been solved using different tech-niques are solved and compared amongst themselves and with other algorithms. It is found out in the research that the sequential transformation methods converge to at least to a local minimum in most cases without the need for the convexity assumptions and with no requirement for differentiability of the objective and constraint functions. It is also revealed in the research that the Hessian matrix of the sequential transformation methods become ill-conditioned in a limit the penalty/barrier parameter goes to infini-ty/or zero. For problems of non-convex functions (with different local minimum points) it is recommended to solve the problem with different starting points, penalty/barrier para-meters and penalty/barrier multipliers and take the best solution. But on the other hand for the exact penalty methods convexity assumptions and second-order sufficiency conditions for a local minimum is needed for the solution of uncon-strained optimization problem to converge to the solution of the original problem with a finite penalty parameter. In these methods a single application of an unconstrained mini-mization technique as against to the sequential methods is used to solve the constrained optimization problem. These methods alleviate the computational difficulties that we face associated with having to take the penalty parameter to infinity.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Weldegiorgis, H. (2010). Penalty and Barrier Function Methods for Constrained Optimization Problems. National Academic Digital Repository of Ethiopia. https://doi.org/10.20372/nadre/7919
MLA 9
Weldegiorgis, Hailay. “Penalty and Barrier Function Methods for Constrained Optimization Problems.” National Academic Digital Repository of Ethiopia, 2010. https://doi.org/10.20372/nadre/7919.
Chicago
Weldegiorgis, Hailay. 2010. “Penalty and Barrier Function Methods for Constrained Optimization Problems.” National Academic Digital Repository of Ethiopia. https://doi.org/10.20372/nadre/7919.
Harvard
Weldegiorgis, H. (2010) ‘Penalty and Barrier Function Methods for Constrained Optimization Problems’, National Academic Digital Repository of Ethiopia. doi:10.20372/nadre/7919.
IEEE
H. Weldegiorgis, “Penalty and Barrier Function Methods for Constrained Optimization Problems,” National Academic Digital Repository of Ethiopia, 2010, doi: 10.20372/nadre/7919.
BibTeX
@phdthesis{weldegiorgis2010penalty,
title = {{Penalty and Barrier Function Methods for Constrained Optimization Problems}},
author = {Weldegiorgis, Hailay},
year = {2010},
doi = {10.20372/nadre/7919},
url = {https://doi.org/10.20372/nadre/7919}
}
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
- penalty method
- barrier function method
- constrained optimization
- exact penalty method
- Powell's method
- convergence analysis
- non-convex optimization
- local minima
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?
Weldegiorgis, H. (2010). Penalty and Barrier Function Methods for Constrained Optimization Problems. National Academic Digital Repository of Ethiopia. https://doi.org/10.20372/nadre/7919
How many times has this paper been cited?
1 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 National Academic Digital Repository of Ethiopia: sign in and open the full text from this page.
Who wrote this paper?
Hailay Weldegiorgis.
What is the DOI of this paper?
10.20372/nadre/7919, permanently at https://doi.org/10.20372/nadre/7919. 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.