Nonlinear constrained optimizer and parallel processing for golden block line search

Duc T. Nguyen; Wilson H. Tang; Yeou-Koung Tung; Hakizumwami B. Runesha

Nonlinear constrained optimizer and parallel processing for golden block line search

Duc T. Nguyen, Wilson H. Tang, Yeou-Koung Tung, Hakizumwami B. Runesha

Disaster Prevention and Water Environment Research Center

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	469-477
Number of pages	9
Journal	Computer Assisted Mechanics and Engineering Sciences
Volume	6
Issue number	3
State	Published - 1 Dec 1999
Event	8th International Conference on Numerical Mathematics and Computational Mechanics (NMCM98) - Miskolc, Hung Duration: 24 Aug 1998 → 27 Aug 1998

Access to Document

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Nonlinear constrained optimizer and parallel processing for golden block line search'. Together they form a unique fingerprint.

Cite this

@article{7b29e6b61b274342b0c980fe1f4284ba,

title = "Nonlinear constrained optimizer and parallel processing for golden block line search",

abstract = "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.",

author = "Nguyen, {Duc T.} and Tang, {Wilson H.} and Yeou-Koung Tung and Runesha, {Hakizumwami B.}",

year = "1999",

month = dec,

day = "1",

language = "English",

volume = "6",

pages = "469--477",

journal = "Computer Assisted Mechanics and Engineering Sciences",

issn = "1232-308X",

publisher = "Polish Academy of Sciences",

number = "3",

note = "null ; Conference date: 24-08-1998 Through 27-08-1998",

}

TY - JOUR

T1 - Nonlinear constrained optimizer and parallel processing for golden block line search

AU - Nguyen, Duc T.

AU - Tang, Wilson H.

AU - Tung, Yeou-Koung

AU - Runesha, Hakizumwami B.

PY - 1999/12/1

Y1 - 1999/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033331704&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0033331704

VL - 6

SP - 469

EP - 477

JO - Computer Assisted Mechanics and Engineering Sciences

JF - Computer Assisted Mechanics and Engineering Sciences

SN - 1232-308X

IS - 3

Y2 - 24 August 1998 through 27 August 1998

ER -