Czasopismo
1999
|
Vol. 6, No. 3-4
|
469-477
Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Warianty tytułu
Konferencja
International Conference on Numerical Mathematics and Computational Mechanics : NMCM'98 (8 th ; August 1998 ; Miskolc ; Hungary)
Języki publikacji
Abstrakty
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.
Rocznik
Tom
Strony
469-477
Opis fizyczny
Bibliogr. 15 poz., tab.
Twórcy
autor
autor
autor
- Old Dominion University , Multidisciplinary Parallel-Vector Computation Center, Kaufman 135, Norfolk, VA 23529, USA
Bibliografia
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.baztech-article-BPB2-0002-0026