Skip to main content

A Lower Order Discrete-Time Recurrent Neural Network for Solving High Order Quadratic Problems with Equality Constraints

  • Conference paper
Advances in Neural Networks - ISNN 2010 (ISNN 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6063))

Included in the following conference series:

Abstract

A lower order discrete-time recurrent neural network is presented in this paper for solving higher quadratic programming. It bases on the orthogonal decomposition method and solves high order quadratic programs, especially for the case that the number of decision variables is close to the number of its constraints. The proposed recurrent neural network is globally exponential stability and converges to the optimal solutions of the higher quadratic programming. The condition for the neural network to globally converge to the optimal solution of the quadratic program is given. An illustrative example and the simulation results are presented to illustrate its performance.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fletcher, M.: Practical Methods of Optimization. John Wiley & Sons, Chichester (1981)

    MATH  Google Scholar 

  2. Hopfield, J.J., Tank, D.W.: Neural Computation of Decisions in Optimal Problems. Biological Cybernetics 52(3), 141–152 (1985)

    MATH  MathSciNet  Google Scholar 

  3. Kennedy, M., Chua, L.O.: Neural Networks for Nonlinear Programming. IEEE Trans. CAS 35(5), 554–562 (1988)

    Article  MathSciNet  Google Scholar 

  4. Wang, J.: Recurrent Neural Network for Solving Quadtratic Propramming Problems with Equality Constraints. Electronics Letter 28(14), 1345–1347 (1992)

    Article  Google Scholar 

  5. Liao, W.D., Wang, J.F.: A Lower Order Recurrent Neural Network for Solving Higher Order Quadratic Programming Problems with Equality Constraints. In: Proceedings of the Second International Joint Conference on Computational Sciences, pp. 176–178 (2009)

    Google Scholar 

  6. Tang, W.S., Wang, J.: A Discrete-time Lagrange Network for Solving Constrained Quadratic Programs. International Journal of Neural Systems 10(4), 261–265 (2000)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liao, W., Wang, J., Wang, J. (2010). A Lower Order Discrete-Time Recurrent Neural Network for Solving High Order Quadratic Problems with Equality Constraints. In: Zhang, L., Lu, BL., Kwok, J. (eds) Advances in Neural Networks - ISNN 2010. ISNN 2010. Lecture Notes in Computer Science, vol 6063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13278-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13278-0_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13277-3

  • Online ISBN: 978-3-642-13278-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics