4.7 Article

A Bi-Projection Neural Network for Solving Constrained Quadratic Optimization Problems

Journal

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNNLS.2015.2500618

Keywords

Bi-projection model; constrained quadratic optimization; data fusion; fast convergence; recurrent neural network

Funding

  1. National Natural Science Foundation of China [61179037, 61473330]
  2. Research Grants Council of the Hong Kong Special Administrative Region [CUHK416812E]

Ask authors/readers for more resources

In this paper, a bi-projection neural network for solving a class of constrained quadratic optimization problems is proposed. It is proved that the proposed neural network is globally stable in the sense of Lyapunov, and the output trajectory of the proposed neural network will converge globally to an optimal solution. Compared with existing projection neural networks (PNNs), the proposed neural network has a very small model size owing to its bi-projection structure. Furthermore, an application to data fusion shows that the proposed neural network is very effective. Numerical results demonstrate that the proposed neural network is much faster than the existing PNNs.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available