Solving Interval Quadratic Program with Box Set Constraints in Engineering by a Projection Neural Network

2010 ◽  
Vol 9 (8) ◽  
pp. 1615-1621 ◽  
Author(s):  
Huaiqin Wu ◽  
Lijun He . ◽  
Leijie Qin ◽  
Tao Feng ◽  
Rui Shi
2010 ◽  
Vol 2010 ◽  
pp. 1-13 ◽  
Author(s):  
Huaiqin Wu ◽  
Rui Shi ◽  
Leijie Qin ◽  
Feng Tao ◽  
Lijun He

This paper presents a nonlinear projection neural network for solving interval quadratic programs subject to box-set constraints in engineering applications. Based on the Saddle point theorem, the equilibrium point of the proposed neural network is proved to be equivalent to the optimal solution of the interval quadratic optimization problems. By employing Lyapunov function approach, the global exponential stability of the proposed neural network is analyzed. Two illustrative examples are provided to show the feasibility and the efficiency of the proposed method in this paper.


2004 ◽  
Vol 16 (4) ◽  
pp. 863-883 ◽  
Author(s):  
Youshen Xia

Recently, a projection neural network has been shown to be a promising computational model for solving variational inequality problems with box constraints. This letter presents an extended projection neural network for solving monotone variational inequality problems with linear and nonlinear constraints. In particular, the proposed neural network can include the projection neural network as a special case. Compared with the modified projection-type methods for solving constrained monotone variational inequality problems, the proposed neural network has a lower complexity and is suitable for parallel implementation. Furthermore, the proposed neural network is theoretically proven to be exponentially convergent to an exact solution without a Lipschitz condition. Illustrative examples show that the extended projection neural network can be used to solve constrained monotone variational inequality problems.


Sign in / Sign up

Export Citation Format

Share Document