Two Projection Neural Networks With Reduced Model Complexity for Nonlinear Programming

Recent reports show that projection neural networks with a low-dimensional state space can enhance computation speed obviously. This paper proposes two projection neural networks with reduced model dimension and complexity (RDPNNs) for solving nonlinear programming (NP) problems. Compared with exist...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transaction on neural networks and learning systems Vol. 31; no. 6; pp. 2020 - 2029
Main Authors:	Xia, Youshen, Wang, Jun, Guo, Wenzhong
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.06.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Complexity Computation Computational complexity Concave programming Convex programming fast computation global stability Hessian matrices Lagrangian function low-dimensional state space Mathematical analysis Matrix methods Neural networks nonconvex programming Nonlinear programming Optimization Projection Quadratic programming
ISSN:	2162-237X, 2162-2388, 2162-2388
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!