Generalized exponential penalty functions are constructed for the multiplier methods in solving nonlinear programming problems. The non-smooth extreme constraint Gext is replaced by a single smooth constraint Gs by using the generalized exponential function (base a>1). The well-known K.S. function is found to be a special case of our proposed formulation. Parallel processing for Golden block line search algorithm is then summarized, which can also be integrated into our formulation. Both small and large-scale nonlinear programming problems (up to 2000 variables and 2000 nonlinear constraints) have been solved to validate the proposed algorithms.
|頁（從 - 到）||469-477|
|期刊||Computer Assisted Mechanics and Engineering Sciences|
|出版狀態||Published - 1 十二月 1999|
|事件||8th International Conference on Numerical Mathematics and Computational Mechanics (NMCM98) - Miskolc, Hung|
持續時間: 24 八月 1998 → 27 八月 1998