A penalty function method for solving inverse optimal value problem
β Scribed by Yibing Lv; Tiesong Hu; Zhongping Wan
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 136 KB
- Volume
- 220
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
In order to consider the inverse optimal value problem under more general conditions, we transform the inverse optimal value problem into a corresponding nonlinear bilevel programming problem equivalently. Using the Kuhn-Tucker optimality condition of the lower level problem, we transform the nonlinear bilevel programming into a normal nonlinear programming. The complementary and slackness condition of the lower level problem is appended to the upper level objective with a penalty. Then we give via an exact penalty method an existence theorem of solutions and propose an algorithm for the inverse optimal value problem, also analysis the convergence of the proposed algorithm. The numerical result shows that the algorithm can solve a wider class of inverse optimal value problem.
π SIMILAR VOLUMES
An exact penalty function type method, which avoids the necessity of solving a sequence of unconstrained problems, solves general constrained parameter minimization problems, and it may be applied to control system computer-aided design problems.
In this paper we present a penalty method for solving a complementarity problem involving a second-order nonlinear parabolic differential operator. In this work we first rewrite the complementarity problem as a nonlinear variational inequality. Then, we define a nonlinear parabolic partial different