An Extended Projection Neural Network for Constrained Optimization

Abstract

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.

Cite

Text

Xia. "An Extended Projection Neural Network for Constrained Optimization." Neural Computation, 2004. doi:10.1162/089976604322860730

Markdown

[Xia. "An Extended Projection Neural Network for Constrained Optimization." Neural Computation, 2004.](https://mlanthology.org/neco/2004/xia2004neco-extended/) doi:10.1162/089976604322860730

BibTeX

@article{xia2004neco-extended,
  title     = {{An Extended Projection Neural Network for Constrained Optimization}},
  author    = {Xia, Youshen},
  journal   = {Neural Computation},
  year      = {2004},
  pages     = {863-883},
  doi       = {10.1162/089976604322860730},
  volume    = {16},
  url       = {https://mlanthology.org/neco/2004/xia2004neco-extended/}
}