Generalized logarithmic penalty function method for solving smooth nonlinear programming involving invex functions
In this paper, we have reviewed some penalty function methods for solving constrained optimization problems in the literature and proposed a continuously differentiable logarithmic penalty function which consists of the proposed logarithmic penalty function and modified Courant-Beltrami penalty func...
Main Authors: | Mansur Hassan, Adam Baharum |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2019-01-01
|
Series: | Arab Journal of Basic and Applied Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/25765299.2019.1600317 |
Similar Items
-
Modified Courant-Beltrami penalty function and a duality gap for invex optimization problem
by: Hassan Mansur, et al.
Published: (2019-01-01) -
Logarithmic penalty function method for invex multi-objective fractional programming problems
by: Mansur Hassan, et al.
Published: (2020-01-01) -
A new logarithmic penalty function approach for nonlinear constrained optimization problem
by: Mansur Hassan, et al.
Published: (2019-04-01) -
Smoothing of the lower-order exact penalty function for inequality constrained optimization
by: Shujun Lian, et al.
Published: (2016-07-01) -
Smoothing approximation to the lower order exact penalty function for inequality constrained optimization
by: Shujun Lian, et al.
Published: (2018-06-01)