Design of recurrent neural networks for solving constrained least absolute deviation problems.
Recurrent neural networks for solving constrained least absolute deviation (LAD) problems or L(1)-norm optimization problems have attracted much interest in recent years. But so far most neural networks can only deal with some special linear constraints efficiently. In this paper, two neural networks are proposed for solving LAD problems with various linear constraints including equality, two-sided inequality and bound constraints. When tailored to solve some special cases of LAD problems in which not all types of constraints are present, the two networks can yield simpler architectures than most existing ones in the literature. In particular, for solving problems with both equality and one-sided inequality constraints, another network is invented. All of the networks proposed in this paper are rigorously shown to be capable of solving the corresponding problems. The different networks designed for solving the same types of problems possess the same structural complexity, which is due to the fact these architectures share the same computing blocks and only differ in connections between some blocks. By this means, some flexibility for circuits realization is provided. Numerical simulations are carried out to illustrate the theoretical results and compare the convergence rates of the networks.
Hu
Xiaolin
X
State Key Laboratory of Intelligent Technology and Systems, TNList, and the Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China. xiaolin.hu@gmail.com
Sun
Changyin
C
Zhang
Bo
B
D000465:Algorithms; D003198:Computer Simulation; D006801:Humans; D016571:Neural Networks, Computer; D017711:Nonlinear Dynamics; D010363:Pattern Recognition, Automated / Q000379:methods*