A new computational method for the functional inequality constrained minimax optimization problem
β Scribed by D.C. Jiang; K.L. Teo; W.Y. Yan
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 715 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we consider a general class of functional inequality constrained minimax optimization problems. This problem is first converted into a semi-infinite programming problem. Then, an auxiliary cost function is constructed based on a positive saturated function. The smallest zero of this auxiliary cost function is equal to the minimal cost of the semi-infinite programming problem. However, this auxiliary cost function is nonsmooth. Thus, a smoothing function is introduced. Then, an efficient computational procedure is developed to estimate the smallest zero of this auxiliary cost function. Furthermore, an error bound is obtained to validate the accuracy of the approximate solution. For illustration, two numerical examples are solved using the proposed approach.
π SIMILAR VOLUMES
A new implementation of the conjugate gradient method is presented that economically overcomes the problem of severe numerical noise superimposed on an otherwise smooth underlying objective function of a constrained optimization problem. This is done by the use of a novel gradient-only line search t
## Abstract A new numerical method is developed for the boundary optimal control problems of the heat conduction equation in the present paper. When the boundary optimal control problem is solved by minimizing the objective function employing a conjugateβgradient method, the most crucial step is th