Skip to main content
Log in

A Discrete-Time Projection Neural Network for Solving Degenerate Convex Quadratic Optimization

  • Short Paper
  • Published:
Circuits, Systems, and Signal Processing Aims and scope Submit manuscript

Abstract

This paper presents a discrete-time neural network to solve convex degenerate quadratic optimization problems. Under certain conditions, it is shown that the proposed neural network is stable in the sense of Lyapunov and globally convergent to an optimal solution. Compared with the existing continuous-time neural networks for degenerate quadratic optimization, the proposed neural network in this paper is more suitable for hardware implementation. Results of two experiments of this neural network are given to illustrate the effectiveness of the proposed neural network.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. M.S. Bazaraa, C.M. Shetty, Nonlinear programming: theory and algorithms. J. Oper. Res. Soc. (1979). doi:10.2307/3009696

  2. H. Che et al., An intelligent method of swarm neural networks for equalities-constrained nonconvex optimization. Neurocomputing. 167, 569–577 (2015)

    Article  Google Scholar 

  3. B. Chen et al., Distributed fusion estimation with communication bandwidth constraints. IEEE Trans. Autom. Control. 60(5), 1398–1403 (2015)

    Article  MathSciNet  Google Scholar 

  4. L. Cheng et al., A neutral-type delayed projection neural network for solving nonlinear variational inequalities. IEEE Trans. Circuits Syst. II Express Briefs 55(8), 806–810 (2008)

    Article  Google Scholar 

  5. L. Cheng et al., Recurrent neural network for non-smooth convex optimization problems with application to the identification of genetic regulatory networks. IEEE Trans. Neural Netw. 22(5), 714–726 (2011)

    Article  MathSciNet  Google Scholar 

  6. X. He et al., An inertial projection neural network for solving variational inequalities. IEEE Trans. Cybern. (2016). doi:10.1109/TCYB.2016.2523541

  7. X. He et al., Neural networks for solving Nash equilibrium problem in application of multiuser power control. Neural Netw. 57(9), 73–78 (2014)

    Article  MATH  Google Scholar 

  8. X. He et al., A recurrent neural network for solving bilevel linear programming problem. IEEE Trans. Neural Netw. Learn. Syst. 25(4), 824–830 (2014)

    Article  Google Scholar 

  9. X. He et al., Neural network for solving convex quadratic bilevel programming problems. Neural Netw. 51(3), 17–25 (2014)

    MathSciNet  MATH  Google Scholar 

  10. Tank Hopfield, “Neural” computation of decisions in optimization problems. Biol. Cybern. 52(3), 141–152 (1985)

    MathSciNet  MATH  Google Scholar 

  11. M. J, Improvement of the convergence speed of a discrete-time recurrent neural network for quadratic optimization with general linear constraints. Neurocomputing 144, 493–500 (2014)

    Article  Google Scholar 

  12. Chua Kennedy, Neural networks for nonlinear programming. IEEE Trans. Circuits Syst. 35(5), 554–562 (1988)

    Article  MathSciNet  Google Scholar 

  13. D. Kinderlehrer, G. Stampacchia, An introduction to variational inequalities and their applications. SIAM. 31, 7–22 (1980)

    MATH  Google Scholar 

  14. S. Lee et al., Landslide susceptibility analysis and its verification using likelihood ratio, logistic regression, and artificial neural network models: case study of Youngin. Landslides 4(4), 327–338 (2007)

    Article  Google Scholar 

  15. H. Li et al., Control of nonlinear networked systems with packet dropouts: interval type-2 fuzzy model-based approach. IEEE Trans. Cybern. (2014). doi:10.1109/TCYB.2371814

  16. C. Li et al., Distributed event-triggered scheme for economic dispatch in smart grids. IEEE Trans. Ind. Inf. (2015). doi:10.1109/TII.2479558

  17. C. Li et al., A generalized Hopfield network for nonsmooth constrained convex optimization: Lie derivative approach. IEEE Trans. Neural Netw. Learn. Syst. 27(2), 308–321 (2016)

    Article  MathSciNet  Google Scholar 

  18. C. Li, X. Yu, W. Yu, Efficient computation for sparse load shifting in demand side management. IEEE Trans. Smart Grid. (2016). doi:10.1109/TSG.2521377

  19. Q. Liu, J. Wang, A one-layer recurrent neural network with a discontinuous activation function for linear programming. Neural Comput. 20(5), 1366–1383 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  20. Q. Liu, J. Wang, A projection neural network for constrained quadratic minimax optimization. IEEE Trans. Neural Netw. Learn. Syst. 26(11), 2891–2900 (2015)

    Article  MathSciNet  Google Scholar 

  21. Q. Liu, J. Wang, A second-order multi-agent network for bound-constrained distributed optimization. IEEE Trans. Autom. Control. 60(12), 3310–3315 (2015)

    Article  MathSciNet  Google Scholar 

  22. Q. Liu et al., One-layer continuous-and discrete-time projection neural networks for solving variational inequalities and related optimization problems. IEEE Trans. Neural Netw. Learn. Syst. 25(7), 1308–1318 (2014)

    Article  Google Scholar 

  23. Q. Liu, J. Cao, Global exponential stability of discrete-time recurrent neural network for solving quadratic programming problems subject to linear constraints. Neurocomputing 74(17), 3494–3501 (2011)

    Article  Google Scholar 

  24. S. Qin et al., Neural network for constrained nonsmooth optimization using Tikhonov regularization. Neural Netw. 63(3), 272–281 (2015)

    Article  MATH  Google Scholar 

  25. S. Qin, X. Xue, A two-layer recurrent neural network for nonsmooth convex optimization problems. IEEE Trans. Neural Netw. Learn. Syst. 26(6), 1149–1160 (2015)

    Article  MathSciNet  Google Scholar 

  26. K.C. Tan et al., Global exponential stability of discrete-time neural networks for constrained quadratic optimization. Neurocomputing 56(3), 399–406 (2004)

    Article  Google Scholar 

  27. Q. Tao, J. Cao, D. Sun, A simple and high performance neural network for quadratic programming problems. Appl. Math. Comput. 124(2), 251–260 (2001)

    MathSciNet  MATH  Google Scholar 

  28. J. Wang, Primal and dual neural networks for shortest-path routing. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 28(6), 864–869 (1998)

    Article  Google Scholar 

  29. W.E. Weideman, Neural network image processing system. U.S.Patent 4941,122 (1990)

  30. Z. Wu et al., Sampled-data fuzzy control of chaotic systems based on T–S fuzzy model. IEEE Trans. Fuzzy Syst. 22(1), 153–163 (2014)

    Article  Google Scholar 

  31. Y. Xia, J. Wang, A general methodology for designing globally convergent optimization neural networks. IEEE Trans. Neural Netw. 9(6), 1331–1343 (1998)

    Article  Google Scholar 

  32. Y. Xia et al., A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations. Neural Netw. 17(7), 1003–1015 (2004)

    Article  MATH  Google Scholar 

  33. Y. Xia et al., A projection neural network and its application to constrained optimization problems. IEEE Trans. Circuits Syst. I Regul. Pap. 49(4), 447–458 (2002)

    Article  MathSciNet  Google Scholar 

  34. Y. Xu et al., Asynchronous dissipative state estimation for stochastic complex networks with quantized jumping coupling and uncertain measurements. IEEE Trans. Neural Netw. Learn. Syst. (2015). doi:10.1109/TNNLS.2503772

  35. X. Xue, W. Bian, A project neural network for solving degenerate convex quadratic program. Neurocomputing 70(13), 2449–2459 (2007)

    Article  Google Scholar 

  36. M. Yashtini, A. Malek, A discrete-time neural network for solving nonlinear convex problems with hybrid constraints. Appl. Math. Comput. 195(2), 576–584 (2008)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work was supported by Natural Science Foundation of China (Grant Nos. 61403313, 61374078), Chongqing Research Program of Basic Research and Frontier Technology (No. cstc2015jcyjBX0052) and also supported by the Natural Science Foundation Project of Chongqing CSTC (No. cstc2014jcyjA40014). This publication was made possible by NPRP Grant No. NPRP 4-1162-1-181 from the Qatar National Research Fund (a member of Qatar Foundation).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chuandong Li.

Appendix

Appendix

Proof of Theorem 1

First, we can construct a Lyapunov function

where is one equilibrium point. Then calculating the difference

(21)

and then, by simple calculation,

Using the inequality in Lemma 1, it follows that

(22)

While

is a semi-positive definite matrix.

Therefore, if the constant satisfies

(23)

That is

(24)

We obtain

(25)

therefore, the network (16) we present is globally convergent. This proof is complete. \(\square \)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, Z., Li, C., He, X. et al. A Discrete-Time Projection Neural Network for Solving Degenerate Convex Quadratic Optimization. Circuits Syst Signal Process 36, 389–403 (2017). https://doi.org/10.1007/s00034-016-0308-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-016-0308-5

Keywords

Navigation