Skip to main content

Neural Networks for Nonconvex Nonlinear Programming Problems: A Switching Control Approach

  • Conference paper
Advances in Neural Networks – ISNN 2005 (ISNN 2005)

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

Included in the following conference series:

  • 1477 Accesses

Abstract

In this paper, neural networks based on switching control approach are proposed, which is aimed at solving in real time a much wider class of nonconvex nonlinear programming problems where the objective function is assumed to satisfy only the weak condition of being regular functions. By using the gradient of the involved functions, the switching control approach proposed is shown to obey a gradient system of differential equation, and its dynamical behavior, trajectory convergence in finite time, and optimization capabilities, for nonconvex problems, are rigorously analyzed in the framework of the theory of differential equations, which are expected to enable to gain further insight on the geometrical structure of the energy landscape (objective function) of each specific class of nonlinear programming problems which is dealt with.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Forti, M., Nistri, P., Quincampoix, M.: Generalized Neural Networks for Nonsmooth Nonlinear Programming Problems. IEEE Trans. Circuits and Systems I 51, 1741–1754 (2004)

    Article  MathSciNet  Google Scholar 

  2. Sudharsanan, S., Sundareshan, M.: Exponential Stability and a Systematic Synthesis of a Neural Network for Quadratic Minimization. Neural Networks 4, 599–613 (1991)

    Article  Google Scholar 

  3. Kennedy, M., Chua, L.: Neural Networks for Linear and Nonlinear Programming. IEEE Trans. Circuits & Systems 35, 554–562 (1988)

    Article  MathSciNet  Google Scholar 

  4. Xia, Y., Wang, J.: Global Exponential Stability of Recurrent Neural Networks for Solving Optimization and Related Problems. IEEE Transaction on Neural Networks 11, 1017–1022 (2000)

    Article  Google Scholar 

  5. Beyer, D., Ogier, R.: Tabu Learning: A Neural Networks Search Method for Solving Nonconvex Optimization Problems. Proceedings of IEEE, 953–961 (2000)

    Google Scholar 

  6. Zhao, H., Chen, K.: Neural Networks for Global Optimization. Control Theory and Applications 19, 824–828 (2002)

    MATH  MathSciNet  Google Scholar 

  7. Forti, M., Tesi, A.: A New Method to Analyze Complete Stability of PWL Cellular Neural Networks. Int. J. Bifurcation Chaos 11, 655–676 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sun, C., Feng, C. (2005). Neural Networks for Nonconvex Nonlinear Programming Problems: A Switching Control Approach. In: Wang, J., Liao, X., Yi, Z. (eds) Advances in Neural Networks – ISNN 2005. ISNN 2005. Lecture Notes in Computer Science, vol 3496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427391_111

Download citation

  • DOI: https://doi.org/10.1007/11427391_111

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25912-1

  • Online ISBN: 978-3-540-32065-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics