A new logarithmic penalty function approach for nonlinear constrained optimization problem
This paper presents a new penalty function called logarithmic penalty function (LPF) and examines the convergence of the proposed LPF method. Furthermore, the LaGrange multiplier for equality constrained optimization is derived based on the first-order necessary condition. The proposed LPF belongs t...
Main Authors: | Mansur Hassan, Adam Baharum |
---|---|
Format: | Article |
Language: | English |
Published: |
Growing Science
2019-04-01
|
Series: | Decision Science Letters |
Subjects: | |
Online Access: | http://www.growingscience.com/dsl/Vol8/dsl_2018_27.pdf |
Similar Items
-
Generalized logarithmic penalty function method for solving smooth nonlinear programming involving invex functions
by: Mansur Hassan, 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) -
Modified Courant-Beltrami penalty function and a duality gap for invex optimization problem
by: Hassan Mansur, et al.
Published: (2019-01-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)