A dual neural network for convex quadratic programming subject to linear equality and inequality constraints ✩

@inproceedings{Zhang2001ADN,
  title={A dual neural network for convex quadratic programming subject to linear equality and inequality constraints ✩},
  author={Yunong Zhang and Jun Wang},
  year={2001}
}
A recurrent neural network called the dual neural network is proposed in this Letter for solving the strictly convex quadratic programming problems. Compared to other recurrent neural networks, the proposed dual network with fewer neurons can solve quadratic programming problems subject to equality, inequality, and bound constraints. The dual neural network is shown to be globally exponentially convergent to optimal solutions of quadratic programming problems. In addition, compared to neural… CONTINUE READING
Highly Cited
This paper has 260 citations. REVIEW CITATIONS