ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
Design of recurrent neural networks for solving constrained least absolute deviation problems
IEEE Transactions on Neural Networks
| Hi-index | 0.00 |
A new neural network for convex quadratic optimization is presented in this brief. The proposed network can handle both equality and inequality constraints, as well as bound constraints on the optimization variables. It is based on the Lagrangian approach, but exploits a partial dual method in order to keep the number of variables at minimum. The dynamic evolution is globally convergent and the steady-state solutions satisfy the necessary and sufficient conditions of optimality. The circuit implementation is simpler with respect to existing solutions for the same class of problems. The validity of the proposed approach is verified through some simulation examples.