摘要

In this paper, we consider how to design a kind of nonlinear neural networks for solving the inverse optimal value problem with convex constraints. Firstly, based on optimal theory, the inverse optimal value problem considered is changed to a class of nonlinear bilevel program problems. Secondly, under the given assumptions, the corresponding nonlinear bilevel programming problem can be reduced to the one-level programming problem. Thirdly, based on the gradient theory, a nonlinear neural network model is designed to solve this one-level programming problem. Moreover, by employing Lyapunov function approach, the proposed neural network is analyzed to be globally Lyapunov stable and capable of generating approximal optimal solution to the inverse optimal value problem. Finally, two illustrative examples are provided to verify the feasibility and the efficiency of the proposed method.

全文